Abstract
Modifications of the inductive assertion method and the wellfoundedness termination proof method are used to analyze the reachability set of arbitrary transition systems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Hopcroft, J. and Pansiot, J.J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comp. Sc. 8 (1979)
Keller, R.M.: Formal verification of parallel programs. CACM, Vol. 19, No. 7 (1976)
Manna, Z. and Waldinger, R.: The logic of computer programming. IEEE Transactions on software eng., Vol. SE-4, No. 3 (1978)
Sifakis, J.: Deadlocks and livelocks in transition systems. In: Mathematical Foundations of Computer Science 1980, Proceedings, ed. P. Dembinski, Springer Lecture Notes in Comp. Science 88 (1980).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Müller, H. (1981). Reachability analysis with assertion systems. In: Deussen, P. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017313
Download citation
DOI: https://doi.org/10.1007/BFb0017313
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10576-3
Online ISBN: 978-3-540-38561-5
eBook Packages: Springer Book Archive