Extended temporal logic revisited

Orna Kupferman, Nir Piterman, Moshe Y. Vardi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

39 Scopus citations

Abstract

A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should extend linear temporal logic with the ability to specify all ω-regular properties. Also, designers, who are familiar with finite-state machines, prefer extensions based on automata than these based on fixed points or propositional quantification. Early extensions of linear temporal logic with automata use nondeterministic Büchi automata. Their drawback has been inability to refer to the past and the asymmetrical structure of nondeterministic automata. In this work we study an extension of linear temporal logic, called ETL2a, that uses two-way alternating automata as temporal connectives. Two way automata can traverse the input word back and forth and they are exponentially more succinct than one-way automata. Alternating automata combine existential and universal branching and they are exponentially more succinct than nondeterministic automata. The rich structure of two-way alternating automata makes ETL2a a very powerful and convenient logic. We show that ETL2a formulas can be translated to nondeterministic Büchi automata with an exponential blow up. It follows that the satisfiability and model-checking problems for ETL2a are PSPACE-complete, as are the ones for LTL and its earlier extensions with automata. So, in spite of the succinctness of two-way and alternating automata, the advantages of ETL2a are obtained without a major increase in space complexity. The recent acceptance of alternating automata by the industry and the development of symbolic procedures for handling them make us optimistic about the practicality of ETL2a.

Original languageAmerican English
Title of host publicationConcurrency Theory - 12th International Conference, CONCUR 2001, Proceedings
EditorsKim G. Larsen, Mogens Nielsen
PublisherSpringer Verlag
Pages519-535
Number of pages17
ISBN (Print)3540424970
DOIs
StatePublished - 2001
Event12th International Conference on Concurrency Theory, CONCUR 2001 - Aalborg, Denmark
Duration: 20 Aug 200125 Aug 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2154
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Conference on Concurrency Theory, CONCUR 2001
Country/TerritoryDenmark
CityAalborg
Period20/08/0125/08/01

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

Fingerprint

Dive into the research topics of 'Extended temporal logic revisited'. Together they form a unique fingerprint.

Cite this