Abstract
It is scetched how the inductive assertion method of Floyd/Hoare and the termination proof method of Floyd/Manna can be used for the analysis of reachability sets for arbitrary initial transition systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
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, Vo. 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)
Queille, J,P, and Sifakis, J,; in these proceedings
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Müller, H. (1982). Inductive Assertions for Analyzing Reachability Sets. In: Girault, C., Reisig, W. (eds) Application and Theory of Petri Nets. Informatik-Fachberichte, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68353-4_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-68353-4_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11189-4
Online ISBN: 978-3-642-68353-4
eBook Packages: Springer Book Archive