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.
|Title of host publication
|Subtitle of host publication
|Concurrency Theory - 8th International Conference, Proceedings
|Antoni Mazurkiewicz, Józef Winkowski
|Number of pages
|Published - 1997
|8th International Conference on Concurrency Theory, CONCUR 1997 - Warsaw, Poland
Duration: 1 Jul 1997 → 4 Jul 1997
|Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|8th International Conference on Concurrency Theory, CONCUR 1997
|1/07/97 → 4/07/97
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.