A new property of choice-free Petri net systems
From MaRDI portal
Publication:5100751
DOI10.1007/978-3-030-51831-8_5zbMATH Open1503.68188OpenAlexW3037915765MaRDI QIDQ5100751FDOQ5100751
Eike Best, Evgeny Erofeev, Raymond Devillers
Publication date: 1 September 2022
Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-51831-8_5
Recommendations
Cites Work
- Free Choice Petri Nets
- Structure theory of equal conflict systems
- Monitors
- The structure of the “THE”-multiprogramming system
- A decomposition theorem for finite persistent transition systems
- State space axioms for T-systems
- Synthesis of live and bounded persistent systems
- Characterisation of the state spaces of marked graph Petri nets
- Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets
- Title not available (Why is that?)
- A Graph-Theoretical Characterisation of State Separation
- Title not available (Why is that?)
- Bounded choice-free Petri net synthesis: algorithmic issues
- Simultaneous Petri Net Synthesis
- Target-oriented Petri Net Synthesis
- Presynthesis of bounded choice-free or fork-attribution nets
Cited In (7)
- Synthesis of (choice-free) reset nets
- Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues
- Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions
- Free-Choice Petri Nets without Frozen Tokens, and Bipolar Synchronization Systems
- Title not available (Why is that?)
- Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
- Free Choice Petri Nets
Uses Software
This page was built for publication: A new property of choice-free Petri net systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5100751)
