Petri net synthesis
From MaRDI portal
Publication:897109
DOI10.1007/978-3-662-47967-4zbMATH Open1351.68003OpenAlexW4205176208MaRDI QIDQ897109FDOQ897109
Authors: Eric Badouel, Luca Bernardinello, Philippe Darondeau 
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
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) 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)
Cited In (64)
- Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets
- Petri Net Primer
- Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns
- Generation of synchronizing state machines from a transition system: a region-based approach
- Identification of labeled Petri nets from finite automata
- Implementable strategies for a two-player asynchronous game on Petri nets
- Strategies for minimising the synthesised ENL-systems
- Synthesis of (choice-free) reset nets
- Title not available (Why is that?)
- The Complexity of Synthesis of b-Bounded Petri Nets
- Title not available (Why is that?)
- Parameterized complexity of synthesizing \(b\)-bounded \((m,n)\)-T-systems
- Discovering object-centric Petri nets
- Target-oriented Petri net synthesis
- Title not available (Why is that?)
- Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable
- Topics in region theory and synthesis problems
- Solving high-level Petri games
- Sufficient conditions for the marked graph realisability of labelled transition systems
- Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues
- Hardness Results for the Synthesis of b-bounded Petri Nets
- Regions of Petri nets with a/sync connections
- Presynthesis of bounded choice-free or fork-attribution nets
- Title not available (Why is that?)
- Applying regions
- The power of prime cycles
- Petri Net Synthesis for Restricted Classes of Nets
- Title not available (Why is that?)
- \(k\)-bounded Petri net synthesis from modal transition systems
- Conditions for Petri net solvable binary words
- The synthesis problem
- Synthesis of Petri nets with whole-place operations and localities
- The synthesis problem of Petri nets
- Narrowing down the hardness barrier of synthesizing elementary net systems
- On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency
- Factorisation of transition systems
- Stability of regional orthomodular posets under synchronisation and refinement
- The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs
- Bounded choice-free Petri net synthesis: algorithmic issues
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments
- Automated repair of process models using non-local constraints
- Synthesis of Petri nets with restricted place-environments: classical and parameterized
- Characterising Petri net solvable binary words
- Adding a/sync places to the synthesis procedure for whole-place operations nets with localities
- Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior
- Title not available (Why is that?)
- On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
- Title not available (Why is that?)
- Signal set tissue systems and overlapping localities
- Reversing Unbounded Petri Nets
- Articulation of Transition Systems and Its Application to Petri Net Synthesis
- Towards Synthesis of Petri Nets from Scenarios
- Synthesising elementary net systems with localities
- Synthesis of Persistent Systems
- Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
- Simultaneous Petri Net Synthesis
- Finding Complex Process-Structures by Exploiting the Token-Game
- Characterisation of the state spaces of marked graph Petri nets
- A graph-theoretical characterisation of state separation
- Automated repair of process models with non-local constraints using state-based region theory
- On the Analysis of Petri Nets and their Synthesis from Process Languages
- Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues
- The complexity of synthesizing elementary net systems relative to natural parameters
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues
This page was built for publication: Petri net synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897109)
