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)
Recommendations
Cited in
(64)- The complexity of synthesizing elementary net systems relative to natural parameters
- Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues
- Synthesis of (choice-free) reset nets
- scientific article; zbMATH DE number 2155180 (Why is no real title available?)
- The Complexity of Synthesis of b-Bounded Petri Nets
- Parameterized complexity of synthesizing \(b\)-bounded \((m,n)\)-T-systems
- scientific article; zbMATH DE number 979001 (Why is no real title available?)
- Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets
- Discovering object-centric Petri nets
- Target-oriented Petri net synthesis
- scientific article; zbMATH DE number 5593270 (Why is no real title available?)
- 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
- Petri Net Primer
- 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
- Regions of Petri nets with a/sync connections
- Presynthesis of bounded choice-free or fork-attribution nets
- Hardness Results for the Synthesis of b-bounded Petri Nets
- Applying regions
- scientific article; zbMATH DE number 1560880 (Why is no real title available?)
- The power of prime cycles
- Petri Net Synthesis for Restricted Classes of Nets
- The synthesis problem of Petri nets
- scientific article; zbMATH DE number 777433 (Why is no real title available?)
- Synthesis of Petri nets with whole-place operations and localities
- Factorisation of transition systems
- \(k\)-bounded Petri net synthesis from modal transition systems
- Conditions for Petri net solvable binary words
- The synthesis problem
- Narrowing down the hardness barrier of synthesizing elementary net systems
- On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency
- 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
- Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns
- Synthesis of Petri nets with restricted place-environments: classical and parameterized
- Automated repair of process models using non-local constraints
- Characterising Petri net solvable binary words
- Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior
- Adding a/sync places to the synthesis procedure for whole-place operations nets with localities
- scientific article; zbMATH DE number 1820089 (Why is no real title available?)
- scientific article; zbMATH DE number 1696446 (Why is no real title available?)
- On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
- Signal set tissue systems and overlapping localities
- Reversing Unbounded Petri 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
- 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
- Characterisation of the state spaces of marked graph Petri nets
- Finding Complex Process-Structures by Exploiting the Token-Game
- A graph-theoretical characterisation of state separation
- 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
- 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
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)
