A Symbolic Algorithm for the Synthesis of Bounded Petri Nets

DOI10.1007/978-3-540-68746-7_10MaRDI QIDQ3510859zbMATH OpenOpenAlexDBLPWikidataFDO

Authors

Publication date 3 July 2008

Published in Applications and Theory of Petri Nets (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2117/130963

Mathematics Subject Classification ID

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

Recommendations

• Bounded choice-free Petri net synthesis: algorithmic issues
• \(k\)-bounded Petri net synthesis from modal transition systems
• Synthesis of bounded choice-free Petri nets
• Polynomial algorithms for the synthesis of bounded nets
• Petri Net Synthesis for Restricted Classes of Nets

Cites work

• A trace semantics for Petri nets
• An event structure semantics for general Petri nets
• Deriving Petri nets from finite transition systems
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1302048 (Why is no real title available?)
• Partial (set) 2-structures. I: Basic notions and the representation problems
• PETRI NETS AND STEP TRANSITION SYSTEMS
• Polynomial algorithms for the synthesis of bounded nets
• The synthesis problem of Petri nets

Cited in

(23)

• Process expression of bounded Petri nets
• The synthesis problem for elementary net systems is NP-complete
• Over-approximative Petri net synthesis for restricted subclasses of nets
• Bounded choice-free Petri net synthesis: algorithmic issues
• Analysis of safeness in a Petri net-based specification of the control part of cyber-physical systems
• Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior
• Petri net synthesis with union/find
• Fault model identification and synthesis in Petri nets
• Petri Net Synthesis for Restricted Classes of Nets
• Comparison of different algorithms to synthesize a Petri net from a partial language
• Process discovery and Petri nets
• Shrinking of time Petri nets
• Projection approaches to process mining using region-based techniques
• Symbolic bounded synthesis
• Bounded Petri net synthesis from modal transition systems is undecidable
• Discovering object-centric Petri nets
• Target-oriented Petri net synthesis
• The Complexity of Synthesis of b-Bounded Petri Nets
• \(k\)-bounded Petri net synthesis from modal transition systems
• Synthesis for various Petri net classes with union/find
• Synthesis of bounded choice-free Petri nets
• Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns
• Reactive synthesis for expected impacts

This page was built for publication: A Symbolic Algorithm for the Synthesis of Bounded Petri Nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3510859)