research-article

From Real-time Logic to Timed Automata

Authors:

Thomas Ferrère,

Dejan Ničković,

Amir PnueliAuthors Info & Claims

Journal of the ACM (JACM), Volume 66, Issue 3

Article No.: 19, Pages 1 - 31

https://doi.org/10.1145/3286976

Published: 23 May 2019 Publication History

Abstract

We show how to construct temporal testers for the logic MITL, a prominent linear-time logic for real-time systems. A temporal tester is a transducer that inputs a signal holding the Boolean value of atomic propositions and outputs the truth value of a formula along time. Here we consider testers over continuous-time Boolean signals that use clock variables to enforce duration constraints, as in timed automata. We first rewrite the MITL formula into a “simple” formula using a limited set of temporal modalities. We then build testers for these specific modalities and show how to compose testers for simple formulae into complex ones. Temporal testers can be turned into acceptors, yielding a compositional translation from MITL to timed automata. This construction is much simpler than previously known and remains asymptotically optimal. It supports both past and future operators and can easily be extended.

References

[1]

2010. IEEE Std 1850-2010 (Revision of IEEE Std 1850-2005). IEEE Standard for Property Specification Language (PSL).

[2]

2012. ANSI/IEEE 1800-2012. IEEE Standard for SystemVerilog. Unified Hardware Design, Specification, and Verification Language.

[3]

Rajeev Alur. 1999. Timed automata. In Proceedings of the International Conference on Computer Aided Verification. Springer, 8--22.

Digital Library

[4]

Rajeev Alur and David L. Dill. 1994. A theory of timed automata. Theor. Comput. Sci. 126, 2 (1994), 183--235.

Digital Library

[5]

Rajeev Alur, Tomás Feder, and Thomas A Henzinger. 1996. The benefits of relaxing punctuality. J. ACM 43, 1 (1996), 116--146.

Digital Library

[6]

Rajeev Alur and Thomas A. Henzinger. 1992. Back to the future: Towards a theory of timed regular languages. In Foundations of Computer Science. IEEE, 177--186.

Digital Library

[7]

Rajeev Alur and Thomas A. Henzinger. 1992. Logics and models of real time: A survey. In Real-Time: Theory in Practice. Springer, 74--106.

Digital Library

[8]

Rajeev Alur and Thomas A. Henzinger. 1994. A really temporal logic. J. ACM 41, 1 (1994), 181--203.

Digital Library

[9]

Eugene Asarin. 2004. Challenges in timed languages: From applied theory to basic theory. Bull. Eur. Assoc. Theor. Comput. Sci. 83 (2004), 106--120.

[10]

Eugene Asarin, Paul Caspi, and Oded Maler. 2002. Timed regular expressions. J. ACM 49, 2 (2002), 172--206.

Digital Library

[11]

Eugene Asarin and Cătălin Dima. 2003. Balanced timed regular expressions1. Electr. Not. Theor. Comput. Sci. 68, 5 (2003).

[12]

Christel Baier, Joost-Pieter Katoen, and Kim Guldstrand Larsen. 2008. Principles of Model Checking. MIT Press.

Digital Library

[13]

David Basin, Srđan Krstić, and Dmitriy Traytel. 2017. Almost event-rate independent monitoring of metric dynamic logic. In Runtime Verification. Springer, 85--102.

Digital Library

[14]

Béatrice Bérard, Michel Bidoit, Alain Finkel, François Laroussinie, Antoine Petit, Laure Petrucci, and Philippe Schnoebelen. 2013. Systems and Software Verification: Model-checking Techniques and Tools. Springer Science 8 Business Media.

[15]

Marcello M. Bersani, Matteo Rossi, and Pierluigi San Pietro. 2015. An SMT-based approach to satisfiability checking of MITL. Inf. Comput. 245 (2015), 72--97.

Digital Library

[16]

Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Nicolas Markey, Joël Ouaknine, and James Worrell. 2018. Model checking real-time systems. In Clarke et al. {28}, Chapter 29, 1001--1046.

[17]

Thomas Brihaye, Morgane Estiévenart, and Gilles Geeraerts. 2013. On MITL and alternating timed automata. In Formal Modeling and Analysis of Timed Systems. 47--61.

Digital Library

[18]

Thomas Brihaye, Morgane Estiévenart, and Gilles Geeraerts. 2014. On MITL and alternating timed automata over infinite words. In Formal Modeling and Analysis of Timed Systems. 69--84.

Digital Library

[19]

Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, and Benjamin Monmege. 2017. Timed-automata-based verification of MITL over signals. In Proceedings of the 24th International Symposium on Temporal Representation and Reasoning (TIME’17). 7:1--7:19.

[20]

Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, and Benjamin Monmege. 2017. MightyL: A compositional translation from MITL to timed automata. In Computer Aided Verification. 421--440.

[21]

Janusz A. Brzozowski and Ernst Leiss. 1980. On equations for regular languages, finite automata, and sequential networks. Theor. Comput. Sci. 10, 1 (1980), 19--35.

[22]

Jerry R. Burch, Edmund M. Clarke, Kenneth L. McMillan, David L. Dill, and Lain-Jinn Hwang. 1992. Symbolic model checking: 10<sup>20</sup> states and beyond. Inf. Comput. 98, 2 (1992), 142--170.

Digital Library

[23]

Ashok K. Chandra and Larry J. Stockmeyer. 1976. Alternation. In Proceedings of the 17th Annual Symposium on Foundations of Computer Science. IEEE, 98--108.

Digital Library

[24]

Alessandro Cimatti, Marco Roveri, Simone Semprini, and Stefano Tonetta. 2006. From PSL to NBA: A modular symbolic encoding. In Proceedings of the Formal Methods in Computer Aided Design (FMCAD’06). IEEE, 125--133.

Digital Library

[25]

Edmund Clarke, Orna Grumberg, and Kiyoharu Hamaguchi. 1994. Another look at LTL model checking. In Proceedings of the International Conference on Computer Aided Verification. Springer, 415--427.

Digital Library

[26]

Edmund M. Clarke and E. Allen Emerson. 1981. Design and synthesis of synchronization skeletons using branching time temporal logic. In Workshop on Logic of Programs. Springer, 52--71.

Digital Library

[27]

Edmund M. Clarke, Orna Grumberg, and Doron Peled. 1999. Model Checking. MIT Press.

Digital Library

[28]

Edmund M. Clarke, Thomas A. Henzinger, Helmut Veith, and Roderick Bloem (Eds.). 2018. Handbook of Model Checking. Springer International Publishing.

Digital Library

[29]

Deepak D’Souza and R. Matteplackel. 2013. A Clock-optimal Hierarchical Monitoring Automaton Construction for MITL. Technical Report.

[30]

Deepak D’Souza and Nicolas Tabareau. 2004. On timed automata with input-determined guards. In Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems. Springer, 68--83.

[31]

Cindy Eisner and Dana Fisman. 2018. Functional specification of hardware via temporal logic. Handbook of Model Checking (2018), 795--829.

[32]

Thomas Ferrère, Oded Maler, and Dejan Ničković. 2015. Trace diagnostics using temporal implicants. In Proceedings of the International Symposium on Automated Technology for Verification and Analysis. Springer, 241--258.

[33]

Paul Gastin and Denis Oddoux. 2001. Fast LTL to Büchi automata translation. In Proceedings of the International Conference on Computer Aided Verification. Springer, 53--65.

Digital Library

[34]

Rob Gerth, Doron Peled, Moshe Y. Vardi, and Pierre Wolper. 1995. Simple on-the-fly automatic verification of linear temporal logic. In Protocol Specification, Testing and Verification XV. Springer, 3--18.

Digital Library

[35]

Dimitra Giannakopoulou and Flavio Lerda. 2002. From states to transitions: Improving translation of LTL formulae to Büchi automata. In Proceedings of the International Conference on Formal Techniques for Networked and Distributed Systems. Springer, 308--326.

Digital Library

[36]

Thomas A. Henzinger. 1998. It’s about time: Real-time logics reviewed. In Proceedings of the International Conference on Concurrency Theory. Springer, 439--454.

Digital Library

[37]

Thomas A. Henzinger, J.-F. Raskin, and P.-Y. Schobbens. 1998. The regular real-time languages. In Automata, Languages and Programming. Springer, 580--591.

Digital Library

[38]

Yoram Hirshfeld and Alexander Rabinovich. 1999. Quantitative temporal logic. In Proceedings of the International Workshop on Computer Science Logic. Springer, 172--187.

Digital Library

[39]

Yoram Hirshfeld and Alexander Rabinovich. 2004. Logics for real time: Decidability and complexity. Fundam. Inf. 62, 1 (2004), 1--28.

Digital Library

[40]

Yoram Hirshfeld and Alexander Rabinovich. 2005. Timer formulas and decidable metric temporal logic. Inf. Comput. 198, 2 (2005), 148--178.

Digital Library

[41]

Yoram Hirshfeld and Alexander Rabinovich. 2006. An expressive temporal logic for real time. In Mathematical Foundations of Computer Science 2006. Springer, 492--504.

Digital Library

[42]

Yoram Hirshfeld and Alexander Rabinovich. 2006. Expressiveness of metric modalities for continuous time. In Computer Science--Theory and Applications. Springer, 211--220.

Digital Library

[43]

Michael Huth and Mark Ryan. 2004. Logic in Computer Science: Modelling and Reasoning About Systems. Cambridge University Press.

Digital Library

[44]

Yonit Kesten and Amir Pnueli. 2005. A compositional approach to CTL* verification. Theor. Comput. Sci. 331, 2--3 (2005), 397--428.

Digital Library

[45]

Yonit Kesten, Amir Pnueli, and Li-on Raviv. 1998. Algorithmic verification of linear temporal logic specifications. In Proceedings of the International Colloquium on Automata, Languages, and Programming. Springer, 1--16.

Digital Library

[46]

Roland Kindermann, Tommi A. Junttila, and Ilkka Niemelä. 2013. Bounded model checking of an MITL fragment for timed automata. In Proceedings of the 13th International Conference on Application of Concurrency to System Design (ACSD’13). 216--225.

Digital Library

[47]

Dileep Raghunath Kini, Shankara Narayanan Krishna, and Paritosh K. Pandya. 2011. On construction of safety signal automata for MITL{U,S} using temporal projections. In Proceedings of the 9th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS’11). 225--239.

Digital Library

[48]

Ron Koymans. 1990. Specifying real-time properties with metric temporal logic. Real-time Syst. 2, 4 (1990), 255--299.

Digital Library

[49]

Ron Koymans, Jan Vytopil, and Willem P. de Roever. 1983. Real-time programming and asynchronous message passing. In Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing. ACM, 187--197.

Digital Library

[50]

Moez Krichen and Stavros Tripakis. 2009. Conformance testing for real-time systems. Formal Methods Syst. Des. 34, 3 (2009), 238--304.

Digital Library

[51]

Kim G. Larsen, Paul Pettersson, and Wang Yi. 1997. UPPAAL in a nutshell. Int. J. Softw. Tools Technol. Transf. 1, 1--2 (1997), 134--152.

Digital Library

[52]

Oded Maler and Dejan Nickovic. 2004. Monitoring temporal properties of continuous signals. In Proceedings of the Joint Conference on Formal Modelling and Analysis of Timed Systems and Formal Techniques in Real-Time and Fault Tolerant System (FORMATS/FTRTFT’04). 152--166.

[53]

Oded Maler, Dejan Nickovic, and Amir Pnueli. 2005. Real time temporal logic: Past, present, future. In Formal Modeling and Analysis of Timed Systems. Springer, 2--16.

Digital Library

[54]

Oded Maler, Dejan Nickovic, and Amir Pnueli. 2006. From MITL to timed automata. In Formal Modeling and Analysis of Timed Systems. Springer, 274--289.

Digital Library

[55]

Oded Maler, Dejan Nickovic, and Amir Pnueli. 2008. Checking temporal properties of discrete, timed and continuous behaviors. In Pillars of Computer Science. 475--505.

Digital Library

[56]

Oded Maler and Amir Pnueli. 2004. On recognizable timed languages. In Proceedings of the International Conference on Foundations of Software Science and Computation Structures. Springer, 348--362.

[57]

Zohar Manna and Amir Pnueli. 1988. The anchored version of the temporal framework. In Proceedings of the Workshop/School/Symposium of the REX Project. Springer, 201--284.

Digital Library

[58]

Zohar Manna and Amir Pnueli. 2012. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer Science 8 Business Media.

Digital Library

[59]

Zohar Manna and Amir Pnueli. 2012. Temporal Verification of Reactive Systems: Safety. Springer Science 8 Business Media.

Digital Library

[60]

Nicolas Markey. 2003. Temporal logic with past is exponentially more succinct. EATCS Bull. 79 (2003), 122--128.

[61]

Max Michel. 1984. Algebre de machines et logique temporelle. In Proceedings of the Annual Symposium on Theoretical Aspects of Computer Science. Springer, 287--298.

Digital Library

[62]

Max Michel. 1985. Computation of temporal operators. Logique Anal. 28, 110/111 (1985), 137--152.

[63]

Satoru Miyano and Takeshi Hayashi. 1984. Alternating finite automata on ω-words. Theor. Comput. Sci. 32, 3 (1984), 321--330.

[64]

Dejan Nickovic. 2008. Checking Timed and Hybrid Properties: Theory and Applications. Ph.D. Dissertation. Université Joseph Fourier, Grenoble, France.

[65]

Maurice Nivat and Dominique Perrin. 1982. Ensembles reconnaissables de mots bi-infinis. In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing. ACM, 47--59.

Digital Library

[66]

Joël Ouaknine and James Worrell. 2005. On the decidability of metric temporal logic. In Logic in Computer Science. IEEE, 188--197.

Digital Library

[67]

Sam Owre, John M. Rushby, and Natarajan Shankar. 1992. PVS: A prototype verification system. In Proceedings of the International Conference on Automated Deduction. Springer, 748--752.

Digital Library

[68]

Amir Pnueli and Aleksandr Zaks. 2006. PSL model checking and run-time verification via testers. In Proceedings of the International Symposium on Formal Methods. Springer, 573--586.

Digital Library

[69]

Amir Pnueli and Aleksandr Zaks. 2008. On the merits of temporal testers. In 25 Years of Model Checking. Springer, 172--195.

Digital Library

[70]

Jean-Pierre Queille and Joseph Sifakis. 1982. Specification and verification of concurrent systems in CESAR. In Proceedings of the International Symposium on Programming. Springer, 337--351.

Digital Library

[71]

Jean-François Raskin and Pierre-Yves Schobbens. 1997. State clock logic: A decidable real-time logic. In Proceedings of the International Workshop on Hybrid and Real-Time Systems. Springer, 33--47.

Digital Library

[72]

Nima Roohi and Mahesh Viswanathan. 2018. Revisiting MITL to fix decision procedures. In Proceedings of the International Conference on Verification, Model Checking, and Abstract Interpretation. Springer, 474--494.

[73]

Fabio Somenzi and Roderick Bloem. 2000. Efficient Büchi automata from LTL formulae. In Proceedings of the International Conference on Computer Aided Verification. Springer, 248--263.

Digital Library

[74]

Boris A. Trakhtenbrot. 2004. Understanding basic automata theory in the continuous time setting. Fundam. Inf. 62, 1 (2004), 69--121.

Digital Library

[75]

Moshe Y. Vardi. 1995. Alternating automata and program verification. In Computer Science Today. Springer, 471--485.

[76]

Moshe Y. Vardi and Pierre Wolper. 1986. An automata-theoretic approach to automatic program verification. In Proceedings of the 1st Symposium on Logic in Computer Science. IEEE Computer Society, 322--331.

[77]

Thomas Wilke. 1994. Specifying timed state sequences in powerful decidable logics and timed automata. In Formal Techniques in Real-Time and Fault-Tolerant Systems. Springer, 694--715.

Digital Library

Cited By

Aghasadeghi AVan den Bussche JStoyanovich J(2024)Temporal graph patterns by timed automataThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-023-00795-z33:1(25-47)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1007/s00778-023-00795-z
Mamouras K(2024)Efficient Offline Monitoring for Dynamic Metric Temporal LogicRuntime Verification10.1007/978-3-031-74234-7_8(128-149)Online publication date: 14-Oct-2024
https://dl.acm.org/doi/10.1007/978-3-031-74234-7_8
Lercher FAlthoff M(2024)Using Four-Valued Signal Temporal Logic for Incremental Verification of Hybrid SystemsComputer Aided Verification10.1007/978-3-031-65633-0_12(259-281)Online publication date: 24-Jul-2024
https://dl.acm.org/doi/10.1007/978-3-031-65633-0_12
Show More Cited By

Index Terms

From Real-time Logic to Timed Automata
1. General and reference
  1. Cross-computing tools and techniques
    1. Verification
2. Theory of computation
  1. Logic
    1. Modal and temporal logics
  2. Models of computation
    1. Timed and hybrid models

Recommendations

Interrupt Timed Automata: verification and expressiveness

We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.

While the reachability problem is undecidable for ...
Past pushdown timed automata and safety verification
Implementation and application automata

We consider past pushdown timed automata that are discrete pushdown timed automata with past formulas as enabling conditions. Using past formulas allows a past pushdown timed automaton to access the past values of the finite state variables in the ...
Context-free timed formalisms: Robust automata and linear temporal logics
Abstract
The paper focuses on automata and linear temporal logics for real-time pushdown reactive systems bridging tractable formalisms specialized for expressing separately dense-time real-time properties and context-free properties though ...

Comments

Information & Contributors

Information

Published In

cover image Journal of the ACM

Journal of the ACM Volume 66, Issue 3

June 2019

221 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/3324923

Editor:
Éva Tardos
Cornell University

Issue’s Table of Contents

Copyright © 2019 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 the author(s) 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: 23 May 2019

Accepted: 01 December 2018

Revised: 01 November 2018

Received: 01 April 2018

Published in JACM Volume 66, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Austrian Science Fund

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
701
Total Downloads

Downloads (Last 12 months)87
Downloads (Last 6 weeks)4

Reflects downloads up to 27 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Aghasadeghi AVan den Bussche JStoyanovich J(2024)Temporal graph patterns by timed automataThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-023-00795-z33:1(25-47)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1007/s00778-023-00795-z
Mamouras K(2024)Efficient Offline Monitoring for Dynamic Metric Temporal LogicRuntime Verification10.1007/978-3-031-74234-7_8(128-149)Online publication date: 14-Oct-2024
https://dl.acm.org/doi/10.1007/978-3-031-74234-7_8
Lercher FAlthoff M(2024)Using Four-Valued Signal Temporal Logic for Incremental Verification of Hybrid SystemsComputer Aided Verification10.1007/978-3-031-65633-0_12(259-281)Online publication date: 24-Jul-2024
https://dl.acm.org/doi/10.1007/978-3-031-65633-0_12
Aineto DScala EOnaindia ESerina IKoenig SStern RVallati M(2023)Falsification of cyber-physical systems using PDDL+ planningProceedings of the Thirty-Third International Conference on Automated Planning and Scheduling10.1609/icaps.v33i1.27172(2-6)Online publication date: 8-Jul-2023
https://dl.acm.org/doi/10.1609/icaps.v33i1.27172
Tian DFang HYang QGuo ZCui JLiang WWu Y(2023)Two-Phase Motion Planning Under Signal Temporal Logic Specifications in Partially Unknown EnvironmentsIEEE Transactions on Industrial Electronics10.1109/TIE.2022.320375270:7(7113-7121)Online publication date: Jul-2023
https://doi.org/10.1109/TIE.2022.3203752
Dong WLi SYin X(2023)Diagnosis of Time-Sensitive Failures in Timed Discrete-Event Systems with Metric Interval Temporal Logics2023 62nd IEEE Conference on Decision and Control (CDC)10.1109/CDC49753.2023.10383314(6827-6833)Online publication date: 13-Dec-2023
https://doi.org/10.1109/CDC49753.2023.10383314
Mamouras KChattopadhyay AWang Z(2023)A compositional framework for algebraic quantitative online monitoring over continuous-time signalsInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-023-00719-w25:4(557-573)Online publication date: 5-Oct-2023
https://dl.acm.org/doi/10.1007/s10009-023-00719-w
Grundt DKöhne ASaxena IStemmer RWestphal BMöhlmann E(2022)Towards Runtime Monitoring of Complex System Requirements for Autonomous Driving FunctionsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.371.4371(53-61)Online publication date: 27-Sep-2022
https://doi.org/10.4204/EPTCS.371.4
Safaoui SLindemann LShames ISummers T(2022)Risk-Bounded Temporal Logic Control of Continuous-Time Stochastic Systems2022 American Control Conference (ACC)10.23919/ACC53348.2022.9867734(1555-1562)Online publication date: 8-Jun-2022
https://doi.org/10.23919/ACC53348.2022.9867734
Lindemann LPappas GDimarogonas D(2022)Reactive and Risk-Aware Control for Signal Temporal LogicIEEE Transactions on Automatic Control10.1109/TAC.2021.312068167:10(5262-5277)Online publication date: Oct-2022
https://doi.org/10.1109/TAC.2021.3120681
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.

HTML Format

View this article in HTML Format.

Figures

Tables

Media

View Issue’s Table of Contents