On the Decidability of Continuous Time Specification Formalisms

We consider an interpretation of monadic second-order logic of order in the continuous time structure of finitely variable signals and show the decidability of monadic logic in this structure. The expressive power of monadic logic is illustrated by providing a straightforward meaning preserving translation into monadic logic of three typical continuous time specification formalism: temporal logic of reals, restricted duration calculus and the propositional fragment of mean value calculus. As a by-product of the decidability of monadic logic we obtain that the above formalisms are decidable even when extended by quantifiers.

[1]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

[2]  Alexander Moshe Rabinovich Expressive Completeness of Temporal Logic of Action , 1998, MFCS.

[3]  Thomas Wilke,et al.  Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata , 1994, FTRTFT.

[4]  Yoav Shoham,et al.  A propositional modal logic of time intervals , 1991, JACM.

[5]  Albert R. Meyer,et al.  WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE , 1973 .

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

[7]  Y HalpernJoseph,et al.  A propositional modal logic of time intervals , 1991 .

[8]  J. R. Büchi On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[9]  Zhou Chaochen,et al.  A mean value calculus of durations , 1994 .

[10]  Larry Joseph Stockmeyer,et al.  The complexity of decision problems in automata theory and logic , 1974 .

[11]  Zohar Manna,et al.  Temporal Verification of Simulation and Refinement , 1993, REX School/Symposium.

[12]  Z. Manna,et al.  Temporal Veri cation of Simulation andRe nement ? , 1994 .

[13]  Paritosh K. Pandya Some extensions to mean-value calculus: expressiveness and de-cidability , 1995 .

[14]  Michael R. Hansen,et al.  Decidability and Undecidability Results for Duration Calculus , 1993, STACS.

[15]  M. Rabin Decidability of second-order theories and automata on infinite trees , 1968 .

[16]  Alexander Moshe Rabinovich,et al.  Non-Elementary Lower Bound for Propositional Duration Calculus , 1998, Inf. Process. Lett..

[17]  S. Shelah The monadic theory of order , 1975, 2305.00968.

[18]  Benjamin Charles Moszkowski Reasoning about Digital Circuits , 1983 .

[19]  Dominique Perrin,et al.  Finite Automata , 1958, Philosophy.