Thomas Hujsa
Abstract
Join-Free Petri nets, whose transitions have at most one input place, model systems without synchronizations, while Choice-Free Petri nets, whose places have at most one output transition, model systems without conflicts. These classes respectively encompass the state machines (S-systems) and the marked graphs (T-systems).
Whereas a structurally bounded and structurally live Petri net is said to be “well-formed”, a bounded and live Petri net is said to be “well-behaved”. Necessary and sufficient conditions for the well-formedness of Join-Free and Choice-Free nets have been known for some time, yet the behavioral properties of these classes are still not well understood. In particular polynomial sufficient conditions for liveness, that is, polynomial in time and with a polynomial initial number of tokens, have not been found until now. Besides, home markings, which can be reached from every reachable marking thus allowing for the construction of systems that can return to their initial data distribution, are not well apprehended either for these subclasses.
We extend results on weighted T-systems to the class of weighted Petri nets and present transformations which preserve the language of the system and reduce the initial marking. We introduce a notion of balancing that makes possible the transformation of conservative systems into so-called “token-conservative” systems, whose number of tokens is invariant, while retaining the feasible transition sequences. This transformation is pertinent for all well-formed Petri nets and leads to polynomial sufficient conditions of liveness for well-formed Join-Free and Choice-Free nets. Finally, we also provide polynomial live and home markings for Fork-Attribution systems.
- Paola Alimonti, Esteban Feuerstein, Luigi Laura, and Umberto Nanni. 2011. Linear time analysis of properties of conflict-free and general Petri nets. Theor. Comput. Sci. 412, 4--5 (2011), 320--38. Google Scholar
Digital Library
- Chérif Amer-Yahia and Noureddine Zerhouni. 1999. Structure theory of choice-free Petri nets based on eigenvalues. J. Franklin Institute (1999).Google Scholar
- Chérif Amer-Yahia, Noureddine Zerhouni, Abdellah El Moudni, and Michel Ferney. 1999. Some subclasses of Petri nets and the analysis of their structural properties: A new approach. IEEE Trans. Syst. Man Cybernet., Part A 29, 2 (1999), 164--172. Google ScholarDigital Library
- Kamel Barkaoui and Michel Minoux. 1992. A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets. In Proceedings of the 13th International Conference on Application and Theory of Petri Nets. 62--75. Google ScholarDigital Library
- Kamel Barkaoui and Jean-François Pradat-Peyre. 1996. On liveness and controlled siphons in Petri nets. In Application and Theory of Petri Nets 1996, J. Billington and W. Reisig (Eds.), Lecture Notes in Computer Science, vol. 1091, Springer, Berlin Heidelberg, 57--72. Google ScholarDigital Library
- Daniel Y. Chao and Jose A. Nicdao. 2001. Liveness for synchronized choice Petri nets. Comput. J. 44, 2 (2001), 124--136.Google ScholarCross Ref
- Jean-Marc Delosme, Thomas Hujsa, and Alix Munier-Kordon. 2013. Polynomial sufficient conditions of well-behavedness for weighted join-free and choice-free systems. In Proceedings of the 13th International Conference on Application of Concurrency to System Design (ACSD'13). 90--99. Google ScholarDigital Library
- Jörg Desel and Javier Esparza. 1995. Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science, vol. 40, Cambridge University Press, New York, NY. Google ScholarDigital Library
- Marc Engels, Greet Bilsen, Rudy Lauwereins, and Jean A. Peperstraete. 1994. Cycle-static dataflow: Model and implementation. In Proceedings of the 20th Asilomar Conference on Signals, Systems and Computers. 503--507.Google Scholar
- Javier Esparza. 1997. Petri nets, commutative context-free grammars, and basic parallel processes. Fundamenta Informaticae 31, 1 (1997), 13--26. Google ScholarDigital Library
- Javier Esparza. 1998. Decidability and complexity of Petri net problems - an introduction. In Lectures on Petri Nets I: Basic Models, W. Reisig and G. Rozenberg (Eds.), Lecture Notes in Computer Science, vol. 1491, Springer, Berlin Heidelberg, 374--428. Google ScholarDigital Library
- Andreas Frommer and Daniel B. Szyld. 2000. On asynchronous iterations. J. Comput. Appl. Math. 123, 1--2 (2000), 201--216. Google ScholarDigital Library
- Li Jiao, To-Yat Cheung, and Weiming Lu. 2004. On liveness and boundedness of asymmetric choice nets. Theor. Comput. Sci. 311, 1--3 (2004), 165--197. Google ScholarDigital Library
- Neil D. Jones, Lawrence H. Landweber, and Y. Edmund Lien. 1977. Complexity of some problems in Petri nets. Theor. Comput. Sci. 4, 3 (1977), 277--299.Google ScholarCross Ref
- Edward A. Lee and David G. Messerschmitt. 1987. Synchronous data flow. Proc. IEEE 75, 9 (1987), 1235--1245.Google ScholarCross Ref
- Olivier Marchetti and Alix Munier-Kordon. 2009. A sufficient condition for the liveness of weighted event graphs. Eur. J. Oper. Res. 197, 2 (2009), 532--540.Google ScholarCross Ref
- Richard Mayr. 2000. Process rewrite systems. Inform. Comput. 156, 1--2 (2000), 264--286. Google ScholarDigital Library
- Nimrod Megiddo. 1987. On the complexity of linear programming. In Proceedings of the 5th World Congress on Advances in Economic Theory. 225--268.Google ScholarCross Ref
- Gérard Memmi and Gérard Roucairol. 1980. Linear algebra in net theory. In Net Theory and Applications, W. Brauer (Ed.), Lecture Notes in Computer Science, vol. 84, Springer, Berlin Heidelberg, 213--223. Google ScholarDigital Library
- Tadao Murata. 1989. Petri nets: Properties, analysis and applications. Proc. IEEE 77, 4 (1989), 541--580.Google ScholarCross Ref
- Laura Recalde, Enrique Teruel, and Manuel Silva. 1995. On well-formedness analysis: The case of deterministic systems of sequential processes. In Structures in Concurrency Theory, J. Desel (Ed.), Springer London, 279--293.Google Scholar
- Laura Recalde, Enrique Teruel, and Manuel Silva. 1996. SC*ECS: A class of modular and hierarchical cooperating systems. In Application and Theory of Petri Nets 1996, J. Billington and W. Reisig (Eds.), Lecture Notes in Computer Science, vol. 1091, Springer, Berlin Heidelberg, 440--459. Google ScholarDigital Library
- Laura Recalde, Enrique Teruel, and Manuel Silva. 1998. Modeling and analysis of sequential processes that cooperate through buffers. IEEE Trans. Robot. Autom. 14, 2 (1998), 267--277.Google ScholarCross Ref
- Joseph Sifakis. 1978. Structural properties of Petri nets. In Mathematical Foundations of Computer Science, J. Winkowski (Ed.), Lecture Notes in Computer Science, vol. 64, Springer, Berlin Heidelberg, 474--483.Google Scholar
- Manuel Silva, Enrique Teruel, and José Manuel Colom. 1998. Linear algebraic and linear programming techniques for the analysis of place/transition net systems. In Lectures on Petri Nets I: Basic Models, W. Reisig and G. Rozenberg (Eds.), Lecture Notes in Computer Science, vol. 1491, Springer, Berlin Heidelberg, 309--373. Google ScholarDigital Library
- Enrique Teruel, Piotr Chrzastowski-Wachtel, José Manuel Colom, and Manuel Silva. 1992. On weighted T-systems. In Application and Theory of Petri Nets 1992, K. Jensen (Ed.), Lecture Notes in Computer Science, vol. 616, Springer, Berlin Heidelberg, 348--367. Google ScholarDigital Library
- Enrique Teruel, José Manuel Colom, and Manuel Silva. 1997. Choice-free Petri nets: A model for deterministic concurrent systems with bulk services and arrivals. IEEE Trans. Syst. Man Cybernet. Part A 27, 1 (1997), 73--83. Google ScholarDigital Library
- Enrique Teruel and Manuel Silva. 1993. Liveness and home states in equal conflict systems. In Application and Theory of Petri Nets 1993, M. Ajmone Marsan (Ed.), Lecture Notes in Computer Science, vol. 691, Springer, Berlin Heidelberg, 415--432. Google ScholarDigital Library
- Enrique Teruel and Manuel Silva. 1996. Structure theory of equal conflict systems. Theor. Comput. Sci. 153, 1&2 (1996), 271--300. Google ScholarDigital Library
- Maarten Wiggers, Marco Jan Gerrit Bekooij, Pierre G. Jansen, and Gerard J. M. Smit. 2007. Efficient computation of buffer capacities for cyclo-static dataflow graphs. In Proceedings of the 44th Design Automation Conference. 658--663. Google ScholarDigital Library
Index Terms
- Polynomial Sufficient Conditions of Well-Behavedness and Home Markings in Subclasses of Weighted Petri Nets
Recommendations
Polynomial Sufficient Conditions of Well-Behavedness for Weighted Join-Free and Choice-Free Systems
ACSD '13: Proceedings of the 2013 13th International Conference on Application of Concurrency to System DesignJoin-Free Petri nets, whose transitions have at most one input place, model systems without synchronizations while Choice-Free Petri nets, whose places have at most one output transition, model systems without conflicts. These classes respectively ...
On Deadlockability, Liveness and Reversibility in Subclasses of Weighted Petri Nets
Application and Theory of Petri Nets and Other Models of Concurrency: Special Issue of Selected Papers from Petri Nets 2017Liveness, (non-)deadlockability and reversibility are behavioral properties of Petri nets that are fundamental for many real-world systems. Such properties are often required to be monotonic, meaning preserved upon any increase of the marking. However, ...
Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods
Application and Theory of Petri Nets and Concurrency: Special Issue of Selected Papers from Petri Nets 2018Numerous real-world systems can be modeled with Petri nets, which allow a combination of concurrency with synchronizations and conflicts. To alleviate the difficulty of checking their behaviour, a common approach consists in studying specific subclasses. ...
Comments