Decidability of model checking for infinite-state concurrent systems

Research output: Contribution to journalArticlepeer-review

103 Scopus citations

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.

Original languageEnglish
Pages (from-to)85-107
Number of pages23
JournalActa Informatica
Volume34
Issue number2
DOIs
StatePublished - 1997

Fingerprint

Dive into the research topics of 'Decidability of model checking for infinite-state concurrent systems'. Together they form a unique fingerprint.

Cite this