## Verification on Infinite Structures (2000)

Citations: | 80 - 2 self |

### BibTeX

@MISC{Burkart00verificationon,

author = {Olaf Burkart and Didier Caucal and Faron Moller and Bernhard Steffen},

title = {Verification on Infinite Structures},

year = {2000}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this chapter, we present a hierarchy of infinite-state systems based on the primitive operations of sequential and parallel composition; the hierarchy includes a variety of commonly-studied classes of systems such as context-free and pushdown automata, and Petri net processes. We then examine the equivalence and regularity checking problems for these classes, with special emphasis on bisimulation equivalence, stressing the structural techniques which have been devised for solving these problems. Finally, we explore the model checking problem over these classes with respect to various linear- and branching-time temporal logics.