A Symbolic Algorithm for the Synthesis of Bounded Petri Nets

DOI10.1007/978-3-540-68746-7_10zbMath1143.68478OpenAlexW1583938627WikidataQ56892275 ScholiaQ56892275MaRDI QIDQ3510859

No author found.

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)

Related Items

Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior, The synthesis problem for elementary net systems is NP-complete, Projection approaches to process mining using region-based techniques, Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns, Bounded choice-free Petri net synthesis: algorithmic issues, Petri Net Synthesis for Restricted Classes of Nets, Discovering Object-centric Petri Nets, Target-oriented Petri Net Synthesis, Process discovery and Petri nets, k-Bounded Petri Net Synthesis from Modal Transition Systems., Fault model identification and synthesis in Petri nets, Analysis of safeness in a Petri net-based specification of the control part of cyber-physical systems

Cites Work

• Unnamed Item
• Unnamed Item
• An event structure semantics for general Petri nets
• Partial (set) 2-structures. I: Basic notions and the representation problems
• A trace semantics for Petri nets
• The synthesis problem of Petri nets
• Graph-Based Algorithms for Boolean Function Manipulation
• PETRI NETS AND STEP TRANSITION SYSTEMS
• Deriving Petri nets from finite transition systems
• Polynomial algorithms for the synthesis of bounded nets