## An automata-theoretic approach to reasoning about infinite-state systems (2000)

### Cached

### Download Links

- [www.cs.huji.ac.il]
- [www.cs.huji.ac.il]
- [www.cs.rice.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | LNCS |

Citations: | 33 - 4 self |

### BibTeX

@INPROCEEDINGS{Kupferman00anautomata-theoretic,

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

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

booktitle = {LNCS},

year = {2000},

pages = {36--52},

publisher = {Springer}

}

### OpenURL

### Abstract

Abstract. We develop an automata-theoretic framework for reasoning about infinitestate 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 automatatheoretic framework is quite versatile. We demonstrate it by solving several versions of the model-checking problem for §-calculus specifications and prefixrecognizable systems, and by solving the realizability and synthesis problems for §-calculus specifications with respect to prefix-recognizable environments. 1