Abstract
This chapter is dedicated to one of the important Petri net analysis tasks - calculation of siphons and traps. For some classes of Petri nets (and their extensions) properties like liveness and reversibility can be decided by analysis of siphons and traps [21, 28, 155, 176, 194, 228, 241, 249] - for example, there is a known result that a free choice net is live, if and only if every siphon contains a marked trap [140, 183]. Finding siphons and traps has a variety of applications to verification and design of parallel systems, such as detection and prevention of deadlocks (usually in a correct system no siphon can be emptied) [65, 81, 92]; one application of this kind will be presented below in Subsection 6.1.3.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). Analysis by Solving Logical Equations — Calculation of Siphons and Traps. In: Dynamic Analysis of Petri Net-Based Discrete Systems. Lecture Notes in Control and Information Sciences, vol 356. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71560-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-71560-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71464-4
Online ISBN: 978-3-540-71560-3
eBook Packages: EngineeringEngineering (R0)