Abstract
Dynamic properties characterize the behaviour of individual CP-nets, e.g., whether it is possible to reach a marking in which no step is enabled. It is often rather difficult to verify dynamic properties — in particular when relying only on informal arguments. However, in Chap. 5 we shall introduce a number of formal analysis methods which can be used to prove dynamic properties. The details of these analysis methods will be the prime contents of Vol. 2.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jensen, K. (1992). Dynamic and Static Properties of Coloured Petri Nets. In: Coloured Petri Nets. EATCS Monographs in Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-06289-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-06289-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-06291-3
Online ISBN: 978-3-662-06289-0
eBook Packages: Springer Book Archive