Chapter PDF
References
S. Aggarwal, D. Barbara, W. Cunto and M. Garey, “Collapsing Reachability Graphs,” submitted for publication.
S. Aggarwal, D. Barbara, K.Z. Meth, “A Software Environment for the Specification and Analysis of Problems of Coordination and Concurrency,” IEEE Transactions on Software Engineering, Vol. 14-3, March 1988.
A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
G. V. Bochmann and P. Merlin, “On the Construction of Communication Protocols,” in Proceedings of the 5th ICCC, Atlanta, Oct. 1980.
M. R. Garey and D. S. Johnson, Computers and Intractability, W. H. Freeman, 1979.
Z. Har'El and R. Kurshan, “COSPAN: A Software System for Analysis of Coordination,” this issue.
S. Lam and U. Shankar, “Protocol Verification via Projections,” IEEE Transactions on Software Engineering, Vol.10, No.4, July 1984.
H. Rudin and C. H. West, (eds.), Protocol Specification, Testing, and Verification, III, North-Holland, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aggarwal, S., Barbara, D., Cunto, W., Garey, M.R. (1990). The complexity of collapsing reachability graphs. In: Sifakis, J. (eds) Automatic Verification Methods for Finite State Systems. CAV 1989. Lecture Notes in Computer Science, vol 407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52148-8_22
Download citation
DOI: https://doi.org/10.1007/3-540-52148-8_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52148-8
Online ISBN: 978-3-540-46905-6
eBook Packages: Springer Book Archive