Hsi-Ming Ho
ABSTRACT
It is well known that (timed) ω-regular properties such as 'p holds at every even position' and 'p occurs at least three times within the next 10 time units' cannot be expressed in Metric Interval Temporal Logic (MITL) and Event Clock Logic (ECL). A standard remedy to this deficiency is to extend these with modalities defined in terms of automata. In this paper, we show that the logics EMITL0, ∞ (adding non-deterministic finite automata modalities into the fragment of MITL with only lower- and upper-bound constraints) and EECL (adding automata modalities into ECL) are already as expressive as EMITL (full MITL with automata modalities). In particular, the satisfiability and model-checking problems for EMITL0, ∞ and EECL are PSPACE-complete, whereas the same problems for EMITL are EXPSPACE-complete. We also provide a simple translation from EMITL0, ∞ to diagonal-free timed automata, which enables practical satisfiability and model checking based on off-the-shelf tools.
- Houssam Abbas, Alena Rodionova, Ezio Bartocci, Scott A. Smolka, and Radu Grosu. 2017. Quantitative Regular Expressions for Arrhythmia Detection Algorithms. In CMSB (LNCS), Vol. 10545. Springer, 23--39.Google Scholar
- Rajeev Alur and David L. Dill. 1994. A Theory of Timed Automata. Theoretical Computer Science 126, 2 (1994), 183--235. Google ScholarDigital Library
- Rajeev Alur, Tomás Feder, and Thomas A. Henzinger. 1996. The Benefits of Relaxing Punctuality. J. ACM 43, 1 (1996), 116--146. Google ScholarDigital Library
- Rajeev Alur and Thomas A. Henzinger. 1993. Real-Time Logics: Complexity and Expressiveness. Information and Computation 104, 1 (1993), 35--77. Google ScholarDigital Library
- Rajeev Alur and Thomas A. Henzinger. 1994. A Really Temporal Logic. J. ACM 41, 1 (1994), 164--169. Google ScholarDigital Library
- Roy Armoni, Limor Fix, Alon Flaisher, Rob Gerth, Boris Ginsburg, Tomer Kanza, Avner Landver, Sela Mador-Haim, Eli Singerman, Andreas Tiemeyer, Moshe Y. Vardi, and Yael Zbar. 2002. The ForSpec Temporal Logic: A New Temporal Property Specification Language. In TACAS (LNCS), Vol. 2280. Springer, 296--311. Google ScholarDigital Library
- Eugene Asarin, Paul Caspi, and Oded Maler. 1997. A Kleene Theorem for Timed Automata. In LICS. IEEE, 160--171. Google ScholarDigital Library
- Eugene Asarin, Paul Caspi, and Oded Maler. 2002. Timed regular expressions. J. ACM 49, 2 (2002), 172--206. Google ScholarDigital Library
- Behnam Banieqbal and Howard Barringer. 1987. Temporal Logic with Fixed Points. In TLS (LNCS), Vol. 398. Springer, 62--74. Google ScholarDigital Library
- David A. Basin, Srdan Krstic, and Dmitriy Traytel. 2017. Almost Event-Rate Independent Monitoring of Metric Dynamic Logic. In RV (LNCS), Vol. 10548. Springer, 85--102.Google Scholar
- Gerd Behrmann, Alexandre David, Kim Guldstrand Larsen, John Håkansson, Paul Pettersson, Wang Yi, and Martijn Hendriks. 2006. UPPAAL 4.0. In QEST. IEEE, 125--126. Google ScholarDigital Library
- Patricia Bouyer. 2003. Untameable Timed Automata!. In STACS (LNCS), Vol. 2607. Springer, 620--631. Google ScholarDigital Library
- Patricia Bouyer and Fabrice Chevalier. 2005. On Conciseness of Extensions of Timed Automata. Journal of Automata, Languages and Combinatorics 10, 4 (2005), 393--405. Google ScholarDigital Library
- Patricia Bouyer, Fabrice Chevalier, and Nicolas Markey. 2010. On the expressiveness of TPTL and MTL. Information and Computation 208, 2 (2010), 97--116.Google ScholarCross Ref
- Patricia Bouyer, François Laroussinie, and Pierre-Alain Reynier. 2005. Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. In FORMATS (LNCS), Vol. 3829. Springer, 112--126. Google ScholarDigital Library
- Thomas Brihaye, Morgane Estiévenart, and Gilles Geeraerts. 2014. On MITL and Alternating Timed Automata of Infinite Words. In FORMATS (LNCS), Vol. 8711. Springer. Google ScholarDigital Library
- Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, and Benjamin Monmege. 2017. MightyL: A Compositional Translation from MITL to Timed Automata. In CAV (LNCS), Vol. 10426. Springer, 421--440.Google Scholar
- Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, and Benjamin Monmege. 2017. Timed-Automata-Based Verification of MITL over Signals. In TIME (LIPIcs), Vol. 90. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 7:1--7:19.Google Scholar
- Costas Courcoubetis, Moshe Y. Vardi, Pierre Wolper, and Mihalis Yannakakis. 1992. Memory-Efficient Algorithms for the Verification of Temporal Properties. Formal Methods in System Design 1, 2/3 (1992), 275--288. Google ScholarDigital Library
- Cindy Eisner and Dana Fisman. 2006. A Practical Introduction to PSL. Springer. 1--240 pages. Google ScholarDigital Library
- Thomas Ferrére. 2018. The Compound Interest in Relaxing Punctuality. In FM (LNCS). Springer. To appear.Google Scholar
- Dov Gabbay, Amir Pnueli, Sharanon Shelah, and J. Stavi. 1980. On the Temporal Analysis of Fairness. In Proceedings of POPL 1980. ACM Press, 163--173. Google ScholarDigital Library
- Paul Gastin, Sayan Mukherjee, and B. Srivathsan. 2018. Reachability in Timed Automata with Diagonal Constraints. In CONCUR (LIPIcs), Vol. 118. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 28:1--28:17.Google Scholar
- Paul Gastin and Denis Oddoux. 2001. Fast LTL to Büchi Automata Translation. In CAV (LNCS), Vol. 2102. Springer, 53--65. Google ScholarDigital Library
- VIRES Simulationstechnologie GmbH. 2016. OpenSCENARIO-Bringing content to the road. (2016). http://www.openscenario.org/docs/OSCUserMeeting20160629pub.pdf Accessed: 2018-09-01.Google Scholar
- Thomas A. Henzinger, Jean-François Raskin, and Pierre-Yves Schobbens. 1998. The Regular Real-Time Languages. In ICALP (LNCS), Vol. 1443. Springer, 580--591. Google ScholarDigital Library
- Yoram Hirshfeld and Alexander Rabinovich. 2007. Expressiveness of Metric modalities for continuous time. Logical Methods in Computer Science 3, 1 (2007), 1--11.Google ScholarCross Ref
- Johan A. Kamp. 1968. Tense logic and the theory of linear order. Ph.D. Dissertation. University of California, Los Angeles.Google Scholar
- Gijs Kant, Alfons Laarman, Jeroen Meijer, Jaco van de Pol, Stefan Blom, and Tom van Dijk. 2015. LTSmin: High-Performance Language-Independent Model Checking. In TACAS (LNCS), Vol. 9035. Springer, 692--707. Google ScholarDigital Library
- Yonit Kesten, Amir Pnueli, and Li on Raviv. 1998. Algorithmic Verification of Linear Temporal Logic Specifications. In ICALP (LNCS), Vol. 1443. Springer, 1--16. Google ScholarDigital Library
- Ron Koymans. 1990. Specifying Real-time Properties with Metric Temporal Logic. Real-Time Systems 2, 4 (1990), 255--299. Google ScholarDigital Library
- Shankara Narayanan Krishna, Khushraj Madnani, and Paritosh K. Pandya. 2016. Metric Temporal Logic with Counting. In FoSSaCS (LNCS), Vol. 9634. Springer, 335--352.Google Scholar
- Shankara Narayanan Krishna, Khushraj Madnani, and Paritosh K. Pandya. 2017. Making Metric Temporal Logic Rational. In MFCS (LIPIcs), Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 77:1--77:14.Google Scholar
- Shankara Narayanan Krishna, Khushraj Madnani, and Paritosh K. Pandya. 2018. Logics Meet 1-Clock Alternating Timed Automata. In CONCUR (LIPIcs), Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 39:1--39:17.Google Scholar
- Orna Kupferman and Moshe Y. Vardi. 1997. Weak Alternating Automata Are Not That Weak. In ISTCS. IEEE, 147--158. Google ScholarDigital Library
- David E. Muller, Ahmed Saoudi, and Paul E. Schupp. 1986. Alternating Automata, the Weak Monadic Theory of the Tree, and its Complexity. In ICALP (LNCS), Vol. 226. Springer, 275--283. Google ScholarDigital Library
- Dejan Ničković. 2008. Checking Timed and Hybrid Properties: Theory and Applications. Ph.D. Dissertation. VERIMAG.Google Scholar
- Dejan Ničković, Olivier Lebeltel, Oded Maler, Thomas Ferrère, and Dogan Ulus. 2018. AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic. In TACAS (LNCS), Vol. 10806. Springer, 303--319.Google Scholar
- Joël Ouaknine and James Worrell. 2006. On Metric Temporal Logic and Faulty Turing Machines. In FoSSaCS (LNCS), Vol. 3921. Springer, 217--230. Google ScholarDigital Library
- Joël Ouaknine and James Worrell. 2007. On the Decidability and Complexity of Metric Temporal Logic over Finite Words. Logical Methods in Computer Science 3, 1 (2007).Google Scholar
- Amir Pnueli. 1977. The temporal logic of programs. In FOCS. IEEE, 46--57. Google ScholarDigital Library
- Jean-François Raskin. 1999. Logics, automata and classical theories for deciding real time. Ph.D. Dissertation. FUNDP (Belgium).Google Scholar
- Gareth Scott Rohde. 1997. Alternating automata and the temporal logic of ordinals. Ph.D. Dissertation. University of Illinois, Urbana Campaign.Google Scholar
- A. P. Sistla and E. M. Clarke. 1985. The Complexity of Propositional Linear Temporal Logics. J. ACM 32, 3 (1985), 733--749. Google ScholarDigital Library
- A. Prasad Sistla, Moshe Y. Vardi, and Pierre Wolper. 1985. The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract). In ICALP (LNCS), Vol. 194. Springer, 465--474. Google ScholarDigital Library
- Moshe Y. Vardi. 1987. Unified Verification Theory. In TLS (LNCS), Vol. 398. Springer, 202--212. Google ScholarDigital Library
- Thomas Wilke. 1994. Specifying timed state sequences in powerful decidable logics and timed automata. In FTRTFT (LNCS), Vol. 863. Springer, 694--715. Google ScholarDigital Library
- Pierre Wolper. 1983. Temporal Logic Can be More Expressive. Information and Control 56, 1/2 (1983), 72--99.Google ScholarCross Ref
- Pierre Wolper and Moshe Y. Vardi. 1994. Reasoning about Infinite Computations. Information and Computation 115, 1 (1994), 1--37. Google ScholarDigital Library
Index Terms
- Revisiting timed logics with automata modalities
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 ...
Alternating timed automata
A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of timed languages that is closed under boolean operations and which has an ...
Undecidable problems about timed automata
FORMATS'06: Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed SystemsWe solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a given timed automaton is determinizable or whether the complement of a ...
Comments