On Process-Algebraic Extensions of Metric Temporal Logic

It is known that the satisfiability problem for Metric Temporal Logic (MTL) is decidable over finite timed words. In this chapter we study the satisfiability problem for extensions of this logic by various process-algebraic operators. On the negative side we show that satisfiability becomes undecidable when any of hiding, renaming, or asynchronous parallel composition are added to the logic. On the positive side we show decidability with the addition of alphabetised parallel composition and fixpoint operators. We use one-clock Timed Propositional Temporal Logic (TPTL(1)) as a technical tool for the decidability results and show that { TPTL(1)} with fixpoints provides a logical characterisation of the class of languages accepted by one-clock timed alternating automata.

[1]  Thomas A. Henzinger,et al.  It's About Time: Real-Time Logics Reviewed , 1998, CONCUR.

[2]  Patricia Bouyer,et al.  On the expressiveness of TPTL and MTL , 2010, Inf. Comput..

[3]  A. W. Roscoe,et al.  A Timed Model for Communicating Sequential Processes , 1986, Theor. Comput. Sci..

[4]  Deepak D'Souza,et al.  On the expressiveness of MTL in the pointwise and continuous semantics , 2007, International Journal on Software Tools for Technology Transfer.

[5]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[6]  Thomas A. Henzinger,et al.  Real-time logics: complexity and expressiveness , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[7]  Slawomir Lasota,et al.  Alternating timed automata , 2005, TOCL.

[8]  Joël Ouaknine,et al.  On Metric Temporal Logic and Faulty Turing Machines , 2006, FoSSaCS.

[9]  Joël Ouaknine,et al.  On the decidability and complexity of Metric Temporal Logic over finite words , 2007, Log. Methods Comput. Sci..

[10]  A. W. Roscoe,et al.  The Timed Failures-Stability Model for CSP , 1999, Theor. Comput. Sci..

[11]  Martin Lange.  Weak Automata for the Linear Time µ-Calculus , 2005, VMCAI.

[12]  Joël Ouaknine,et al.  On Expressiveness and Complexity in Real-Time Model Checking , 2008, ICALP.

[13]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[14]  Thomas A. Henzinger,et al.  A really temporal logic , 1989, 30th Annual Symposium on Foundations of Computer Science.

[15]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[16]  Pierre-Yves Schobbens,et al.  The Regular Real-Time Languages , 1998, ICALP.

[17]  Thomas A. Henzinger,et al.  The temporal specification and verification of real-time systems , 1991 .

[18]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[19]  A. W. Roscoe,et al.  Metric Spaces as Models for Real-Time Concurrency , 1987, MFPS.

[20]  Alain J. Mayer,et al.  The Complexity of PDL with Interleaving , 1996, Theor. Comput. Sci..

[21]  Ron Koymans,et al.  Specifying real-time properties with metric temporal logic , 1990, Real-Time Systems.

[22]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[23]  Joël Ouaknine,et al.  Some Recent Results in Metric Temporal Logic , 2008, FORMATS.

[24]  Pierre Wolper,et al.  The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract) , 1985, ICALP.

[25]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[26]  Rüdiger Reinecke,et al.  Hoares Communicating Sequential Processes: Erweiterung des Spurenmodells , 1985 .