APT
From MaRDI portal
Cited in
(35)- Over-approximative Petri net synthesis for restricted subclasses of nets
- Bounded choice-free Petri net synthesis: algorithmic issues
- JaCoP
- Relabelling LTS for Petri net synthesis via solving separation problems
- Lifted structural invariant analysis of Petri net product lines
- 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
- Motras
- Petrify
- Genet
- Synthesis and reengineering of persistent systems
- Presynthesis of bounded choice-free or fork-attribution nets
- Characterising Petri net solvable binary words
- The power of prime cycles
- Petri Net Synthesis for Restricted Classes of Nets
- Synet
- Reversible computation vs. reversibility in Petri nets
- Parameterized complexity of synthesizing \(b\)-bounded \((m,n)\)-T-systems
- PIPE2
- Incremental process discovery using Petri net synthesis
- Bounded Petri net synthesis from modal transition systems is undecidable
- Simultaneous Petri Net Synthesis
- Target-oriented Petri net synthesis
- On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency
- Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
- The Complexity of Synthesis of b-Bounded Petri Nets
- Symbolic and structural model-checking
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues
- Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues
- A new property of choice-free Petri net systems
- Structural reductions revisited
- \(k\)-bounded Petri net synthesis from modal transition systems
- Analysis of Petri nets and transition systems
- Conditions for Petri net solvable binary words
This page was built for software: APT
