Petri net synthesis
From MaRDI portal
Publication:897109
DOI10.1007/978-3-662-47967-4zbMath1351.68003OpenAlexW4205176208MaRDI QIDQ897109
Philippe Darondeau, Eric Badouel, Luca Bernardinello
Publication date: 16 December 2015
Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01237142/file/Badouel_Petri%20Net%20Synthesis_Front%20matter.pdf
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Sufficient conditions for the marked graph realisability of labelled transition systems ⋮ Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues ⋮ Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues ⋮ Synthesis of Petri Nets with Whole-Place Operations and Localities ⋮ Factorisation of transition systems ⋮ Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues ⋮ Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior ⋮ Solving high-level Petri games ⋮ Signal set tissue systems and overlapping localities ⋮ Automated Repair of Process Models Using Non-local Constraints ⋮ On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets ⋮ Generation of synchronizing state machines from a transition system: a region-based approach ⋮ Articulation of Transition Systems and Its Application to Petri Net Synthesis ⋮ Hardness Results for the Synthesis of b-bounded Petri Nets ⋮ Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets ⋮ Reversing Unbounded Petri Nets ⋮ Finding Complex Process-Structures by Exploiting the Token-Game ⋮ Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns ⋮ Unnamed Item ⋮ A Graph-Theoretical Characterisation of State Separation ⋮ Unnamed Item ⋮ Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems ⋮ On the parameterized complexity of the synthesis of Boolean nets with restricted place environments ⋮ Characterisation of the state spaces of marked graph Petri nets ⋮ Synthesis of Persistent Systems ⋮ Bounded choice-free Petri net synthesis: algorithmic issues ⋮ Stability of regional orthomodular posets under synchronisation and refinement ⋮ The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs ⋮ Applying regions ⋮ Presynthesis of bounded choice-free or fork-attribution nets ⋮ The complexity of synthesizing elementary net systems relative to natural parameters ⋮ Characterising Petri Net Solvable Binary Words ⋮ The Power of Prime Cycles ⋮ Petri Net Synthesis for Restricted Classes of Nets ⋮ Discovering Object-centric Petri Nets ⋮ Target-oriented Petri Net Synthesis ⋮ Synthesising elementary net systems with localities ⋮ k-Bounded Petri Net Synthesis from Modal Transition Systems. ⋮ Conditions for Petri Net Solvable Binary Words ⋮ Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis ⋮ The Complexity of Synthesis of b-Bounded Petri Nets ⋮ Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory ⋮ Topics in region theory and synthesis problems ⋮ Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable ⋮ Synthesis of (choice-free) reset nets ⋮ Synthesis of Petri nets with restricted place-environments: classical and parameterized
