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

Orna Kupferman; Moshe Y. Vardi

doi:10.1007/10722167_7

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

Orna Kupferman
, Moshe Y. Vardi

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

59 Scopus citations

Abstract

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 language	English
Title of host publication	Computer Aided Verification - 12th International Conference, CAV 2000, Proceedings
Editors	E. Allen Emerson, A. Prasad Sistla
Publisher	Springer Verlag
Pages	36-52
Number of pages	17
ISBN (Print)	3540677704
DOIs	https://doi.org/10.1007/10722167_7
State	Published - 2000
Event	12th International Conference on Computer Aided Verification, CAV 2000 - Chicago, United States Duration: 15 Jul 2000 → 19 Jul 2000

Publication series

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

Conference

Conference	12th International Conference on Computer Aided Verification, CAV 2000
Country/Territory	United States
City	Chicago
Period	15/07/00 → 19/07/00

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.

Access to Document

10.1007/10722167_7

Cite this

Kupferman, O., & Vardi, M. Y. (2000). An automata-theoretic approach to reasoning about infinite-state systems. In E. Allen Emerson, & A. Prasad Sistla (Eds.), Computer Aided Verification - 12th International Conference, CAV 2000, Proceedings (pp. 36-52). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1855). Springer Verlag. https://doi.org/10.1007/10722167_7

Kupferman, Orna ; Vardi, Moshe Y. / An automata-theoretic approach to reasoning about infinite-state systems. Computer Aided Verification - 12th International Conference, CAV 2000, Proceedings. editor / E. Allen Emerson ; A. Prasad Sistla. Springer Verlag, 2000. pp. 36-52 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{6c48e6e3158c4f9880cc528da92f402a,

title = "An automata-theoretic approach to reasoning about infinite-state systems",

abstract = "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.",

author = "Orna Kupferman and Vardi, \{Moshe Y.\}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 12th International Conference on Computer Aided Verification, CAV 2000 ; Conference date: 15-07-2000 Through 19-07-2000",

year = "2000",

doi = "10.1007/10722167\_7",

language = "אנגלית",

isbn = "3540677704",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "36--52",

editor = "\{Allen Emerson\}, E. and \{Prasad Sistla\}, A.",

booktitle = "Computer Aided Verification - 12th International Conference, CAV 2000, Proceedings",

address = "גרמניה",

}

Kupferman, O & Vardi, MY 2000, An automata-theoretic approach to reasoning about infinite-state systems. in E Allen Emerson & A Prasad Sistla (eds), Computer Aided Verification - 12th International Conference, CAV 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1855, Springer Verlag, pp. 36-52, 12th International Conference on Computer Aided Verification, CAV 2000, Chicago, United States, 15/07/00. https://doi.org/10.1007/10722167_7

An automata-theoretic approach to reasoning about infinite-state systems. / Kupferman, Orna; Vardi, Moshe Y.
Computer Aided Verification - 12th International Conference, CAV 2000, Proceedings. ed. / E. Allen Emerson; A. Prasad Sistla. Springer Verlag, 2000. p. 36-52 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1855).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Kupferman, Orna

AU - Vardi, Moshe Y.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2000.

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84944414150

U2 - 10.1007/10722167_7

DO - 10.1007/10722167_7

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84944414150

SN - 3540677704

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 36

EP - 52

BT - Computer Aided Verification - 12th International Conference, CAV 2000, Proceedings

A2 - Allen Emerson, E.

A2 - Prasad Sistla, A.

PB - Springer Verlag

T2 - 12th International Conference on Computer Aided Verification, CAV 2000

Y2 - 15 July 2000 through 19 July 2000

ER -

Kupferman O, Vardi MY. An automata-theoretic approach to reasoning about infinite-state systems. In Allen Emerson E, Prasad Sistla A, editors, Computer Aided Verification - 12th International Conference, CAV 2000, Proceedings. Springer Verlag. 2000. p. 36-52. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/10722167_7

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

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this