Abstract.
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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 29 November 1994 / 15 November 1995
Rights and permissions
About this article
Cite this article
Esparza, J. Decidability of model checking for infinite-state concurrent systems . Acta Informatica 34, 85–107 (1997). https://doi.org/10.1007/s002360050074
Issue Date:
DOI: https://doi.org/10.1007/s002360050074