An automata-theoretic approach to reasoning about infinite-state systems

Orna Kupferman, Moshe Y. Vardi

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

58 Scopus citations


We develop an automata-theoretic framework for reasoning about infinite-state sequential systems. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finite-state automata. Checking that the system satisfies a temporal property can then be done by an alternating two-way tree automaton that navigates through the tree. As has been the case with finite-state systems, the automata-theoretic framework is quite versatile. We demonstrate it by solving several versions of the model-checking problem for µ-calculus specifications and prefix-recognizable systems, and by solving the realizability and synthesis problems for µ-calculus specifications with respect to prefix-recognizable environments.

Original languageAmerican English
Title of host publicationComputer Aided Verification - 12th International Conference, CAV 2000, Proceedings
EditorsE. Allen Emerson, A. Prasad Sistla
PublisherSpringer Verlag
Number of pages17
ISBN (Print)3540677704
StatePublished - 2000
Event12th International Conference on Computer Aided Verification, CAV 2000 - Chicago, United States
Duration: 15 Jul 200019 Jul 2000

Publication series

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


Conference12th International Conference on Computer Aided Verification, CAV 2000
Country/TerritoryUnited States

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.


Dive into the research topics of 'An automata-theoretic approach to reasoning about infinite-state systems'. Together they form a unique fingerprint.

Cite this