TY - JOUR
T1 - On the decidability of continuous time specification formalisms
AU - Rabinovich, Alexander
PY - 1998/10
Y1 - 1998/10
N2 - 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.
AB - 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.
KW - Decidability
KW - Duration calculus
KW - Monadic second-order logic
KW - Temporal logic
UR - http://www.scopus.com/inward/record.url?scp=0032180683&partnerID=8YFLogxK
U2 - 10.1093/logcom/8.5.669
DO - 10.1093/logcom/8.5.669
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0032180683
SN - 0955-792X
VL - 8
SP - 669
EP - 678
JO - Journal of Logic and Computation
JF - Journal of Logic and Computation
IS - 5
ER -