Decidable metric logics

Yoram Hirshfeld*, Alex Rabinovich

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

The common metric temporal logic for continuous time were shown to be insufficient, when it was proved that they cannot express a modality suggested by Pnueli. Moreover no finite temporal logic can express all the natural generalizations of this modality. It followed that if we look for an optimal decidable metric logic we must accept infinitely many modalities, or adopt a different formalism. Here we identify a fragment of the second order monadic logic of order with the " + 1 " function, that expresses all the Pnueli modalities and much more. Its main advantage over the temporal logics is that it enables us to say not just that within prescribed time there is a point where some punctual event will occur, but also that within prescribed time some process that starts now (or that started before, or that will start soon) will terminate. We prove that this logic is decidable with respect to satisfiability and validity, over continuous time. The proof depends heavily on the theory of compositionality. In particular every temporal logic that has truth tables in this logic is automatically decidable. We extend this result by proving that any temporal logic, that has all its modalities defined by means more general than truth tables, in a logic stronger than the one just described, has a decidable satisfiability problem. We suggest that this monadic logic can be the framework in which temporal logics can be safely defined, with the guarantee that their satisfiability problem is decidable.

Original languageEnglish
Pages (from-to)1425-1442
Number of pages18
JournalInformation and Computation
Volume206
Issue number12
DOIs
StatePublished - Dec 2008

Fingerprint

Dive into the research topics of 'Decidable metric logics'. Together they form a unique fingerprint.

Cite this