research-article

A theory of sampling for continuous-time metric temporal logic

Authors:

Carlo A. Furia,

Matteo RossiAuthors Info & Claims

ACM Transactions on Computational Logic (TOCL), Volume 12, Issue 1

Article No.: 8, Pages 1 - 40

https://doi.org/10.1145/1838552.1838560

Published: 26 November 2010 Publication History

Abstract

This article revisits the classical notion of sampling in the setting of real-time temporal logics for the modeling and analysis of systems. The relationship between the satisfiability of metric temporal logic (MTL) formulas over continuous-time models and over discrete-time models is studied. It is shown to what extent discrete-time sequences obtained by sampling continuous-time signals capture the semantics of MTL formulas over the two time domains. The main results apply to “flat” formulas that do not nest temporal operators and can be applied to the problem of reducing the verification problem for MTL over continuous-time models to the same problem over discrete time, resulting in an automated partial practically efficient discretization technique.

References

[1]

Alur, R., Feder, T., and Henzinger, T. A. 1996. The benefits of relaxing punctuality. J. ACM 43, 1, 116--146.

Digital Library

[2]

Alur, R. and Henzinger, T. A. 1993. Real-time logics: Complexity and expressiveness. Inform. Comput. 104, 1, 35--77.

Digital Library

[3]

Asarin, E., Maler, O., and Pnueli, A. 1998. On discretization of delays in timed automata and digital circuits. In Proceedings of the 9th International Conference on Concurrency Theory (CONCUR). D. Sangiorgi and R. de Simone, Eds. Lecture Notes in Computer Science, vol. 1466. Springer-Verlag, Berlin, Germany, 470--484.

Digital Library

[4]

Benedetto, J. J. and Ferreira, P. J. S. G., Eds. 2001. Modern Sampling Theory. Birkäuser, Boston, MA.

[5]

Bersani, M. M., Furia, C. A., Pradella, M., and Rossi, M. 2009. Integrated modeling and verification of real-time systems through multiple paradigms. In Proceedings of the 7th IEEE International Conference on Software Engineering and Formal Methods (SEFM). IEEE Computer Society Press, Los Alamitos, CA.

Digital Library

[6]

Beyer, D., Lewerentz, C., and Noack, A. 2003. Rabbit: A tool for BDD-based verification of real-time systems. In Proceedings of the 15th International Conference on Computer Aided Verification (CAV). W. A. H. Jr. and F. Somenzi, Eds. Lecture Notes in Computer Science, vol. 2725. Springer-Verlag, Berlin, Germany, 122--125.

[7]

Bianculli, D., Morzenti, A., Pradella, M., San Pietro, P., and Spoletini, P. 2007. Trio2Promela: A model checker for temporal metric specifications. In ICSE Companion. 61--62.

Digital Library

[8]

Bošnački, D. 1999. Digitization of timed automata. In Proceedings of the 4th International Workshop on Formal Methods for Industrial Critical Systems (FMICS). 283--302.

[9]

Bouajjani, A., Echahed, R., and Robbana, R. 1994. Verifying invariance properties of timed systems with duration variables. In Proceedings of the 3rd International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT). Lecture Notes in Computer Science, vol. 863. Springer-Verlag, Berlin, Germany, 193--210.

Digital Library

[10]

Bouyer, P., Markey, N., Ouaknine, J., and Worrell, J. 2007. The cost of punctuality. In Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, Los Alamitos, CA.

Digital Library

[11]

Bozga, M., Maler, O., and Tripakis, S. 1999. Efficient verification of timed automata using dense and discrete time semantics. In Proceedings of the 10th Correct Hardware Design and Verification Methods Advanced Research Working Conference (CHARME). L. Pierre and T. Kropf, Eds. Lecture Notes in Computer Science, vol. 1703. Springer-Verlag, Berlin, Germany, 125--141.

Digital Library

[12]

Chakravorty, G. and Pandya, P. K. 2003. Digiziting interval duration logic. In Proceedings of the 15th International Conference on Computer Aided Verification (CAV), W. A. Hunt, Jr. and F. Somenzi, Eds. Lecture Notes in Computer Science, vol. 2725. Springer-Verlag, Berlin, Germany, 167--179.

[13]

Cimatti, A., Clarke, E. M., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., and Tacchella, A. 2002. NuSMV 2: An opensource tool for symbolic model checking. In Proceedings of the 14th International Conference on Computer-Aided Verification (CAV). Lecture Notes in Computer Science, vol. 2404. Springer-Verlag, Berlin, Germany, 359--364.

Digital Library

[14]

Clarke, E. M., Lerda, F., and Talupur, M. 2007. An abstraction technique for real-time verification. In Proceedings of the GM R&D Workshop on Next Generation Design and Verification Methodologies for Distributed Embedded Control System.

[15]

Comon, H. and Cortier, V. 2000. Flatness is not a weakness. In Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic. Lecture Notes in Computer Science, vol. 1862. Springer-Verlag, Berlin, Germany, 262--276.

Digital Library

[16]

Dams, D. 1999. Flat fragments of CTL and CTL&ast;: Separating the expressive and distinguishing powers. Log. J. IGPL 7, 1, 55--78.

[17]

de Alfaro, L. and Manna, Z. 1995. Verification in continuous time by discrete reasoning. In Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology (AMAST), V. S. Alagar and M. Nivat, Eds. Lecture Notes in Computer Science, vol. 936. Springer-Verlag, Berlin, Germany, 292--306.

Digital Library

[18]

De Wulf, M., Doyen, L., Maquet, N., and Raskin, J.-F. 2009. ALASKA: Antichains for logic, automata and symbolic Kripke structures analysis. In Proceeding of the 6th International Symposium on Automated Technology for Verification and Analysis (ATVA). Lecture Notes in Computer Science, vol. 5311. Springer-Verlag, Berlin, Germany, 240--245.

Digital Library

[19]

Demri, S. and Schnoebelen, P. 2002. The complexity of propositional linear temporal logics in simple cases. Inform. Comput. 174, 1, 84--103.

Digital Library

[20]

D'Souza, D., Mohan M., R., and Prabhakar, P. 2007. Flattening metric temporal logic. Manuscript.

[21]

Etessami, K. and Wilke, T. 1996. An until hierarchy for temporal logic. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, Los Alamitos, CA, 108--117.

Digital Library

[22]

Fainekos, G. E. and Pappas, G. J. 2007. Robust sampling for MITL specifications. In Proceedings of the 5th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS). Lecture Notes in Computer Science, vol. 4763. Springer-Verlag, Berlin, Germany, 147--162.

Digital Library

[23]

Fainekos, G. E. and Pappas, G. J. 2009. Robustness of temporal logic specifications for continuous time signals. Theoret. Comput. Sci. 410, 42, 4262-4291.

Digital Library

[24]

Furia, C. A. 2007. Scaling up the formal analysis of real-time systems. Ph.D. dissertation, Dipartimento di Elettronica e Informazione, Politecnico di Milano, Milan, Italy.

[25]

Furia, C. A., Mandrioli, D., Morzenti, A., and Rossi, M. 2010. Modeling time in computing: A taxonomy and a comparative survey. ACM Comput. Surv. 42, 2, 1--59. Article 6. http://arxiv.org/abs/0807.4132.

Digital Library

[26]

Furia, C. A., Pradella, M., and Rossi, M. 2008a. Automated verification of dense-time MTL specifications via discrete-time approximation. In Proceedings of the 15th International Symposium on Formal Methods (FM). J. Cuéllar and T. Maibaum, Eds. Lecture Notes in Computer Science, vol. 5014. Springer-Verlag, Berlin, Germany, 132--147.

Digital Library

[27]

Furia, C. A., Pradella, M., and Rossi, M. 2008b. Practical automated partial verification of multi-paradigm real-time models. In Proceedings of the 10th International Conference on Formal Engineering Methods (ICFEM), S. Liu, T. Maibaum, and K. Araki, Eds. Lecture Notes in Computer Science, vol. 5256. Springer-Verlag, Berlin, Germany, 298--317.

Digital Library

[28]

Furia, C. A. and Rossi, M. 2006. Integrating discrete- and continuous-time metric temporal logics through sampling. In Proceedings of the 4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS). E. Asarin and P. Bouyer, Eds. Lecture Notes in Computer Science, vol. 4202. Springer-Verlag, Berlin, Germany, 215--229.

Digital Library

[29]

Furia, C. A. and Rossi, M. 2007. On the expressiveness of MTL variants over dense time. In Proceedings of the 5th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS). J.-F. Raskin and P. S. Thiagarajan, Eds. Lecture Notes in Computer Science, vol. 4763. Springer-Verlag, Berlin, Germany, 163--178.

Digital Library

[30]

Furia, C. A. and Rossi, M. 2008. MTL with bounded variability: Decidability and complexity. In Proceedings of the 6th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS). F. Cassez and C. Jard, Eds. Lecture Notes in Computer Science, vol. 5215. Springer-Verlag, Berlin, Germany, 109--123.

Digital Library

[31]

Göllü, A., Puri, A., and Varaiya, P. 1994. Discretization of timed automata. In Proceedings of the 33rd Conference on Decision and Control. 957--958.

[32]

Graham, R. L., Knuth, D. E., and Patashnik, O. 1994. Concrete Mathematics: A Foundation for Computer Science, 2nd Ed. Addison-Wesley, Reading, MA.

Digital Library

[33]

Heitmeier, C. and Mandrioli, D., Eds. 1996. Formal Methods for Real-Time Computing. John Wiley & Sons, New York, NY.

Digital Library

[34]

Henzinger, T. A., Manna, Z., and Pnueli, A. 1992. What good are digital clocks&quest; In Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP). W. Kuich, Ed. Lecture Notes in Computer Science, vol. 623. Springer-Verlag, Berlin, Germany, 545--558.

Digital Library

[35]

Henzinger, T. A. and Sifakis, J. 2006. The embedded systems design challenge. In Proceedings of the 14th International Symposium on Formal Methods (FM). J. Misra, T. Nipkow, and E. Sekerinski, Eds. Lecture Notes in Computer Science, vol. 4085. Springer-Verlag, Berlin, Germany, 1--15.

Digital Library

[36]

Hirshfeld, Y. and Rabinovich, A. M. 2004. Logics for real time: Decidability and complexity. Fundamenta Informaticae 62, 1, 1--28.

Digital Library

[37]

Hirshfeld, Y. and Rabinovich, A. M. 2005. Timer formulas and decidable metric temporal logic. Inform. Comput. 198, 2, 148--178.

Digital Library

[38]

Hung, D. V. and Giang, P. H. 1996. Sampling semantics of duration calculus. In Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT). B. Jonsson and J. Parrow, Eds. Lecture Notes in Computer Science, vol. 1135. Springer-Verlag, Berlin, Germany, 188--207.

Digital Library

[39]

Koymans, R. 1990. Specifying real-time properties with metric temporal logic. Real-Time Syst. 2, 4, 255--299.

Digital Library

[40]

Koymans, R. 1992. (real) time: A philosophical perspective. In Proceedings of the REX Workshop: “Real-Time: Theory in Practice,” J. W. de Bakker, C. Huizing, W. P. de Roever, and G. Rozenberg, Eds. Lecture Notes in Computer Science, vol. 600. Springer-Verlag, Berlin, Germany, 353--370.

Digital Library

[41]

Krčál, P. and Pelánek, R. 2005. On sampled semantics of timed systems. In Proceedings of the 25th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). R. Ramanujam and S. Sen, Eds. Lecture Notes in Computer Science, vol. 3821. Springer-Verlag, Berlin, Germany, 310--321.

Digital Library

[42]

Kučera, A. and Strejček, J. 2005. The stuttering principle revisited. Acta Informatica 41, 7/8, 415--434.

Digital Library

[43]

Maler, O., Nickovic, D., and Pnueli, A. 2006. From MITL to timed automata. In Proceedings of the 4th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS). E. Asarin and P. Bouyer, Eds. Lecture Notes in Computer Science, vol. 4202. Springer-Verlag, Berlin, Germany, 274--289.

Digital Library

[44]

Maler, O. and Pnueli, A. 1995. Timing analysis of asynchronous circuits using timed automata. In Proceedings of the Advanced Research Working Conference on Correct Hardware Design and Verification Methods. P. Camurati and H. Eveking, Eds. Lecture Notes in Computer Science, vol. 987. Springer-Verlag, Berlin, Germany, 189--205.

Digital Library

[45]

Ouaknine, J. 2002. Digitisation and full abstraction for dense-time model checking. In Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). J.-P. Katoen and P. Stevens, Eds. Lecture Notes in Computer Science, vol. 2280. Springer-Verlag, Berlin, Germany, 37--51.

Digital Library

[46]

Ouaknine, J. and Worrell, J. 2003. Revisiting digitization, robustness, and decidability for timed automata. In Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, Los Alamitos, CA, 198--207.

Digital Library

[47]

Pandya, P. K. 2008. Personal communication.

[48]

Pandya, P. K., Narayanan Krishna, S., and Loya, K. 2007. On sampling abstraction of continuous time logic with durations. In Proceeding of the 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Lecture Notes in Computer Science, vol. 4424. Springer-Verlag, Berlin, Germany, 246--260.

Digital Library

[49]

Perrin, D. and Pin, J.-É. 2004. Infinite Words. Pure and Applied Mathematics, vol. 141. Elsevier, Amsterdam, The Netherlands.

[50]

Pradella, M., Morzenti, A., and San Pietro, P. 2007. The symmetry of the past and of the future: Bi-infinite time in the verification of temporal properties. In Proceedings of the 6th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE). 312--320.

Digital Library

[51]

Pradella, M., San Pietro, P., Spoletini, P., and Morzenti, A. 2003. Practical model checking of LTL with past. In Proceedings of 1st International Workshop on Automated Technology for Verification and Analysis (ATVA). F. Wang and I. Lee, Eds. 135--146.

[52]

Rabinovich, A. M. 2003. Automata over continuous time. Theoret. Comput. Sci. 300, 1--3, 331--363.

Digital Library

[53]

Thérien, D. and Wilke, T. 2004. Nesting until and since in linear temporal logic. Theor. Comput. Syst. 37, 1, 111--131.

Cited By

Selvaratnam DCantoni MDavoren JShames I(2022)MITL Verification Under Timing UncertaintyFormal Modeling and Analysis of Timed Systems10.1007/978-3-031-15839-1_8(136-152)Online publication date: 29-Aug-2022
https://doi.org/10.1007/978-3-031-15839-1_8
Basin DKlaedtke FZăźLinescu E(2018)Algorithms for monitoring real-time propertiesActa Informatica10.1007/s00236-017-0295-455:4(309-338)Online publication date: 1-Jun-2018
https://dl.acm.org/doi/10.1007/s00236-017-0295-4
Baresi LMorzenti AMotta AK. MRossi M(2017)A Logic-Based Approach for the Verification of UML Timed ModelsACM Transactions on Software Engineering and Methodology10.1145/310641126:2(1-47)Online publication date: 18-Sep-2017
https://dl.acm.org/doi/10.1145/3106411
Show More Cited By

Recommendations

Expressive Completeness for Metric Temporal Logic
LICS '13: Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Metric Temporal Logic (MTL) is a generalisation of Linear Temporal Logic in which the Until and Since modalities are annotated with intervals that express metric constraints. Hirshfeld and Rabinovich have shown that over the reals, first-order logic ...
On Metric Temporal Łukasiewicz Logic

In this paper we present a logical framework to cope with temporal reasoning under vagueness. The calculus is obtained by extending that of bounded metric temporal logic over a dense time domain, by truth-values from the rational unit interval [0,1]@?Q, ...
Constructive linear-time temporal logic: Proof systems and Kripke semantics

In this paper we study a version of constructive linear-time temporal logic (LTL) with the ''next'' temporal operator. The logic is originally due to Davies, who has shown that the proof system of the logic corresponds to a type system for binding-time ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Computational Logic

ACM Transactions on Computational Logic Volume 12, Issue 1

October 2010

334 pages

ISSN:1529-3785

EISSN:1557-945X

DOI:10.1145/1838552

Issue’s Table of Contents

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 November 2010

Accepted: 01 April 2010

Revised: 01 March 2010

Received: 01 December 2009

Published in TOCL Volume 12, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Seventh Framework Programme

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
295
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Selvaratnam DCantoni MDavoren JShames I(2022)MITL Verification Under Timing UncertaintyFormal Modeling and Analysis of Timed Systems10.1007/978-3-031-15839-1_8(136-152)Online publication date: 29-Aug-2022
https://doi.org/10.1007/978-3-031-15839-1_8
Basin DKlaedtke FZăźLinescu E(2018)Algorithms for monitoring real-time propertiesActa Informatica10.1007/s00236-017-0295-455:4(309-338)Online publication date: 1-Jun-2018
https://dl.acm.org/doi/10.1007/s00236-017-0295-4
Baresi LMorzenti AMotta AK. MRossi M(2017)A Logic-Based Approach for the Verification of UML Timed ModelsACM Transactions on Software Engineering and Methodology10.1145/310641126:2(1-47)Online publication date: 18-Sep-2017
https://dl.acm.org/doi/10.1145/3106411
Furia CSpoletini P(2017)Bounded variability of metric temporal logicAnnals of Mathematics and Artificial Intelligence10.1007/s10472-016-9532-880:3-4(283-316)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1007/s10472-016-9532-8
Rossi MMandrioli DMorzenti AFerrucci L(2016)A temporal logic for micro- and macro-step-based real-time systemsTheoretical Computer Science10.1016/j.tcs.2016.06.042643:C(38-64)Online publication date: 30-Aug-2016
https://dl.acm.org/doi/10.1016/j.tcs.2016.06.042
Woźna-Szcześniak BZbrzezny A(2014)Checking MTL Properties of Discrete Timed Automata via Bounded Model CheckingFundamenta Informaticae10.5555/2692080.2692095135:4(553-568)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.5555/2692080.2692095
Furia CSpoletini P(2014)Bounded Variability of Metric Temporal Logic2014 21st International Symposium on Temporal Representation and Reasoning10.1109/TIME.2014.18(155-163)Online publication date: Sep-2014
https://doi.org/10.1109/TIME.2014.18
Baresi LFerretti GLeva ARossi M(2012)Flexible logic-based Co-simulation of Modelica modelsIEEE 10th International Conference on Industrial Informatics10.1109/INDIN.2012.6301223(635-640)Online publication date: Jul-2012
https://doi.org/10.1109/INDIN.2012.6301223
Furia CMandrioli DMorzenti ARossi MFuria CMandrioli DMorzenti ARossi M(2012)Logic-Based FormalismsModeling Time in Computing10.1007/978-3-642-32332-4_9(249-323)Online publication date: 29-Aug-2012
https://doi.org/10.1007/978-3-642-32332-4_9
Furia CMandrioli DMorzenti ARossi MFuria CMandrioli DMorzenti ARossi M(2012)Dimensions of the Time Modeling ProblemModeling Time in Computing10.1007/978-3-642-32332-4_3(27-57)Online publication date: 29-Aug-2012
https://doi.org/10.1007/978-3-642-32332-4_3
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents