Abstract
This chapter presents two of the functions (tools) that are available in the GPenSIM for the analysis of Petri nets: coverability tree and firing sequences. In coverability tree analysis, we determine the states that are reachable from a given initial state. The firing sequence is executing a sequence of transitions, to study the state space generated by the firings.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cassandras, C. G., & Lafortune, S. (2009). Introduction to discrete event systems. Berlin: Springer Science & Business Media.
Davidrajuh, R. (2013). Extended reachability graph of petri net for cost estimation. In 8th EUROSIM Congress on Modelling and Simulation, Cardiff, Wales, September 10–12, 2013, pp. 378–382.
Murata, T. (1989). Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4), 541–580.
Peterson, J. L. (1981). Petri net theory and the modeling of systems. USA: Prentice-Hall.
Reisig, W. (2013a). Elements of distributed algorithms: modeling and analysis with Petri nets. Berlin: Springer Science & Business Media.
Reisig, W. (2013b). Understanding Petri nets: modeling techniques, analysis methods, case studies. Berlin: Springer.
Saadallah, N. (2015). Scheduling drilling processes with Petri nets. Ph.D. Dissertation. Norway: University of Stavanger.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 The Author(s)
About this chapter
Cite this chapter
Davidrajuh, R. (2018). Analysis of Petri nets. In: Modeling Discrete-Event Systems with GPenSIM. SpringerBriefs in Applied Sciences and Technology. Springer, Cham. https://doi.org/10.1007/978-3-319-73102-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-73102-5_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-73101-8
Online ISBN: 978-3-319-73102-5
eBook Packages: EngineeringEngineering (R0)