On the complexity of verifying concurrent transition systems

David Harel*, Orna Kupferman, Moshe Y. Vardi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

37 Scopus citations

Abstract

In implementation verification, we check that an implementation is correct with respect to a specification by checking whether the behaviors of a transition system that models the program's implementation correlate with the behaviors of a transition system that models its specification. In this paper, we investigate the effect of concurrency on the complexity of implementation verification. We consider trace-based and tree-based approaches to the verification of concurrent transition systems, with and without fairness. Our results show that in almost all cases the complexity of the problem is exponentially harder than that of the sequential case. Thus, as in the model-checking verification methodology, the state-explosion problem cannot be avoided.

Original languageAmerican English
Pages (from-to)143-161
Number of pages19
JournalInformation and Computation
Volume173
Issue number2
DOIs
StatePublished - 15 Mar 2002

Fingerprint

Dive into the research topics of 'On the complexity of verifying concurrent transition systems'. Together they form a unique fingerprint.

Cite this