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.
Part of this research was done in Bell Laboratories during the DIMACS special year on Logic and Algorithms.
Supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the AFOSR contract F49620-93-1-0056, by the ARO MURI grant DAAH-04-96-1-0341, by the ARPA grant NAG2-892, and by the SRC contract 95-DC-324.036.
Supported in part by the NSF grant CCR-9628400.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253–284, 1991.
A. Aziz, V. Singhal, F. Balarin, R. Brayton, and A.L. Sangiovanni-Vincentelli. Equivalences for fair kripke structures. In Proc. 21st ICALP, Jerusalem, 1994.
S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property preserving simulations. In Proc. 4th CAV, LNCS 663, Montreal, 1992.
J. Balcazar, J. Gabarro, and M. Santha. Deciding bisimilarity is P-complete. Formal Aspects of Computing, 4(6):638–648, 1992.
O. Bemholtz, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In Proc. 6th CAV, LNCS 818, pages 142–155, Stanford, 1994.
E.M. Clarke and O. Grumberg and D. Long. Verification tools for finite-state concurrent systems. In Decade of Concurrency-Reflections and Perspectives,LNCS 803, pages 124–175, 1993.
A.K. Chandra, D.C. Kozen, and L.J. Stockmeyer. Alternation. Journal of the Association for Computing Machinery, 28(1):114–133, January 1981.
D. Drusinsky and D. Harel. On the power of bounded concurrency I: Finite automata. Journal of the ACM, 41(3):517–539, 1994.
O. Grumberg and D.E. Long. Model checking and modular verification. ACM Trans. on Programming Languages and Systems, 16(3):843–871, 1994.
D. Harel. Statecharts: A visual formalism for complex systems. Sci. Comp. Prog., 8:231–274, 1987.
D. Harel. A thesis for bounded concurrency. In Proc. 14th MFOCS, LNCS 379, pages 35–48, New York, 1989.
M. Hennessy. Algebraic theory of Processes. MIT Press, Cambridge, 1985.
T. Hirst and D. Harel. On the power of bounded concurrency II: Pushdown automata. Journal of the ACM, 41(3):540–554, 1994.
D. Harel, R. Rosner, and M.Y. Vardi. On the power of bounded concurrency iii: Reasoning about programs. In Proc. 5th LICS, Philadelphia, 1990.
D. Kozen. Lower bounds for natural proof systems. In Proc. 18th FOCS, pages 254–266, 1977.
R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
O. Kupferman and M.Y. Vardi. Verification of fair transition systems. In Proc. 8th CAV, LNCS 1102, pages 372–382. Rutgers, 1996.
O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proc. 12th POPL, pages 97–107, New Orleans, 1985.
D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness —the ethics of concurrent termination. In Proc. 8th ICALP, LNCS 115, pages 264–277. 1981.
S.S. Lam and A.U. Shankar. Protocol verification via projection. IEEE Trans. on Software Engineering, 10:325–342, 1984.
R. Milner. An algebraic definition of simulation between programs. In Proc. 2nd IJCAl, pages 481–489, 1971.
R. Milner. A Calculus of Communicating Systems, LNCS 92, Springer Verlag, Berlin, 1980.
R. Milner. Communication and Concurrecny. Prentice-Hall, Englewood Clifs, 1989.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, Berlin, January 1992.
A.P. Sistla, M.Y. Vardi, and P. Wolper. The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science, 49:217–237, 1987.
M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1–37, November 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Harel, D., Kupferman, O., Vardi, M.Y. (1997). On the complexity of verifying concurrent transition systems. In: Mazurkiewicz, A., Winkowski, J. (eds) CONCUR '97: Concurrency Theory. CONCUR 1997. Lecture Notes in Computer Science, vol 1243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63141-0_18
Download citation
DOI: https://doi.org/10.1007/3-540-63141-0_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63141-5
Online ISBN: 978-3-540-69188-4
eBook Packages: Springer Book Archive