Skip to main content
Log in

Decidability of model checking for infinite-state concurrent systems

  • Published:
Acta Informatica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 29 November 1994 / 15 November 1995

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360050074

Keywords

Navigation