I7 Logo
Chair for Foundations of Software Reliability and Theoretical Computer Science
Informatik Logo TUM Logo
Publications - Decidability of Model-checking for Infinite-state Concurrent Systems


J. Esparza. Decidability of model-checking for infinite-state concurrent systems. Acta Informatica, 34:85–107, 1997.


We study the decidability of the model checking problem for linear and branching time logics, and two models of concurrent computation, namely Petri nets and Basic Parallel Processes

Suggested BibTeX entry:

    author = {J. Esparza},
    journal = {Acta Informatica},
    pages = {85--107},
    title = {Decidability of Model-checking for Infinite-state Concurrent Systems},
    volume = {34},
    year = {1997}

GZipped PostScript (83 kB)
PDF (282 kB)