On the complexity of verifying concurrent transition systems

David Harel; Orna Kupferman; Moshe Y. Vardi

doi:10.1007/3-540-63141-0_18

On the complexity of verifying concurrent transition systems

David Harel, Orna Kupferman, Moshe Y. Vardi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

20 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 stateexplosion problem cannot be avoided.

Original language	English
Title of host publication	CONCUR 1997
Subtitle of host publication	Concurrency Theory - 8th International Conference, Proceedings
Editors	Antoni Mazurkiewicz, Józef Winkowski
Publisher	Springer Verlag
Pages	258-272
Number of pages	15
ISBN (Print)	3540631410, 9783540631415
DOIs	https://doi.org/10.1007/3-540-63141-0_18
State	Published - 1997
Externally published	Yes
Event	8th International Conference on Concurrency Theory, CONCUR 1997 - Warsaw, Poland Duration: 1 Jul 1997 → 4 Jul 1997

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1243
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	8th International Conference on Concurrency Theory, CONCUR 1997
Country/Territory	Poland
City	Warsaw
Period	1/07/97 → 4/07/97

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.

Access to Document

10.1007/3-540-63141-0_18

Cite this

Harel, D., Kupferman, O., & Vardi, M. Y. (1997). On the complexity of verifying concurrent transition systems. In A. Mazurkiewicz, & J. Winkowski (Eds.), CONCUR 1997: Concurrency Theory - 8th International Conference, Proceedings (pp. 258-272). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1243). Springer Verlag. https://doi.org/10.1007/3-540-63141-0_18

Harel, David ; Kupferman, Orna ; Vardi, Moshe Y. / On the complexity of verifying concurrent transition systems. CONCUR 1997: Concurrency Theory - 8th International Conference, Proceedings. editor / Antoni Mazurkiewicz ; Józef Winkowski. Springer Verlag, 1997. pp. 258-272 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e9ed92ae770a4d4c836d6372be79171b,

title = "On the complexity of verifying concurrent transition systems",

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 stateexplosion problem cannot be avoided.",

author = "David Harel and Orna Kupferman and Vardi, {Moshe Y.}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; 8th International Conference on Concurrency Theory, CONCUR 1997 ; Conference date: 01-07-1997 Through 04-07-1997",

year = "1997",

doi = "10.1007/3-540-63141-0_18",

language = "אנגלית",

isbn = "3540631410",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "258--272",

editor = "Antoni Mazurkiewicz and J{\'o}zef Winkowski",

booktitle = "CONCUR 1997",

address = "גרמניה",

}

Harel, D, Kupferman, O & Vardi, MY 1997, On the complexity of verifying concurrent transition systems. in A Mazurkiewicz & J Winkowski (eds), CONCUR 1997: Concurrency Theory - 8th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1243, Springer Verlag, pp. 258-272, 8th International Conference on Concurrency Theory, CONCUR 1997, Warsaw, Poland, 1/07/97. https://doi.org/10.1007/3-540-63141-0_18

On the complexity of verifying concurrent transition systems. / Harel, David; Kupferman, Orna; Vardi, Moshe Y.
CONCUR 1997: Concurrency Theory - 8th International Conference, Proceedings. ed. / Antoni Mazurkiewicz; Józef Winkowski. Springer Verlag, 1997. p. 258-272 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1243).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On the complexity of verifying concurrent transition systems

AU - Harel, David

AU - Kupferman, Orna

AU - Vardi, Moshe Y.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1997.

PY - 1997

Y1 - 1997

N2 - 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 stateexplosion problem cannot be avoided.

AB - 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 stateexplosion problem cannot be avoided.

UR - http://www.scopus.com/inward/record.url?scp=84957874512&partnerID=8YFLogxK

U2 - 10.1007/3-540-63141-0_18

DO - 10.1007/3-540-63141-0_18

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84957874512

SN - 3540631410

SN - 9783540631415

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 258

EP - 272

BT - CONCUR 1997

A2 - Mazurkiewicz, Antoni

A2 - Winkowski, Józef

PB - Springer Verlag

T2 - 8th International Conference on Concurrency Theory, CONCUR 1997

Y2 - 1 July 1997 through 4 July 1997

ER -

Harel D, Kupferman O, Vardi MY. On the complexity of verifying concurrent transition systems. In Mazurkiewicz A, Winkowski J, editors, CONCUR 1997: Concurrency Theory - 8th International Conference, Proceedings. Springer Verlag. 1997. p. 258-272. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-63141-0_18

On the complexity of verifying concurrent transition systems

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this