Abstract
This chapter provides a comprehensive description of augmented marked graphs and their properties. It starts with the basic definition and terminology of augmented marked graphs. Some special properties pertaining to cycles and siphons for augmented marked graphs are then discussed. These are followed by a detailed investigation of the liveness, reversibility, boundedness and conservativeness of augmented marked graphs. Algorithms for checking these properties are derived accordingly.
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
References
F. Chu, X. Xie, Deadlock analysis of Petri nets using siphons and mathematical programming. IEEE Trans. Robot. Autom. 13(6), 793–804 (1997)
K.S. Cheung, New characterisation for live and reversible augmented marked graphs. Inf. Process. Lett. 92(5), 239–243 (2004)
K.S. Cheung, K.O. Chow, Cycle-inclusion property of augmented marked graphs. Inf. Process. Lett. 94(6), 271–276 (2005)
K.S. Cheung, Augmented marked graphs. Informatica 32(1), 85–94 (2008)
K. Barkaoui et al., On liveness in extended non self-controlling net, in Application and Theory of Petri Nets, ed. by G.D. Michelis, M. Diaz. Lecture Notes in Computer Science, vol. 935 (Springer, Berlin, 1995), pp. 25–44
K.S. Cheung, Boundedness and conservativeness of augmented marked graphs. IMA J. Math. Control. Inf. 24(2), 235–24 (2007)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Cheung, K.S. (2014). Augmented Marked Graphs. In: Augmented Marked Graphs. Springer, Cham. https://doi.org/10.1007/978-3-319-06428-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-06428-4_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06427-7
Online ISBN: 978-3-319-06428-4
eBook Packages: Computer ScienceComputer Science (R0)