A new property of choice-free Petri net systems

DOI10.1007/978-3-030-51831-8_5MaRDI QIDQ5100751zbMATHOpenAlexFDO

Authors Eike Best, Raymond Devillers, Evgeny Erofeev

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

zbMATH Keywords

synthesisPetri netsstructural conditionschoice-freeness

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Synthesis of bounded choice-free Petri nets
• Bounded choice-free Petri net synthesis: algorithmic issues
• Simultaneous Petri Net Synthesis
• Presynthesis of bounded choice-free or fork-attribution nets
• Free Choice Petri Nets

Cites work

• scientific article; zbMATH DE number 1415080 (Why is no real title available?)
• A decomposition theorem for finite persistent transition systems
• A graph-theoretical characterisation of state separation
• Analysis of Petri nets and transition systems
• Bounded choice-free Petri net synthesis: algorithmic issues
• Characterisation of the state spaces of live and bounded marked graph Petri nets
• Characterisation of the state spaces of marked graph Petri nets
• Free Choice Petri Nets
• Monitors
• Presynthesis of bounded choice-free or fork-attribution nets
• Simultaneous Petri Net Synthesis
• State space axioms for T-systems
• Structure theory of equal conflict systems
• Synthesis of live and bounded persistent systems
• Target-oriented Petri net synthesis
• The structure of the “THE”-multiprogramming system

Cited in

(11)

• Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues
• Synthesis of (choice-free) reset nets
• Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
• scientific article; zbMATH DE number 107897 (Why is no real title available?)
• Free Choice Petri Nets
• Free-Choice Petri Nets without Frozen Tokens, and Bipolar Synchronization Systems
• Presynthesis of bounded choice-free or fork-attribution nets
• Bounded choice-free Petri net synthesis: algorithmic issues
• Synthesis of bounded choice-free Petri nets
• Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions
• The power of prime cycles

Describes a project that uses

Uses Software

• APT
• GitHub

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)