APT

swMATH23176MaRDI QIDQ34960FDOQ34960

Author name not available (Why is that?)

Source code repository: https://github.com/CvO-Theory/apt

Cited In (29)

• Synthesis of (choice-free) reset nets
• The Complexity of Synthesis of b-Bounded Petri Nets
• Symbolic and structural model-checking
• Parameterized complexity of synthesizing \(b\)-bounded \((m,n)\)-T-systems
• Target-oriented Petri net synthesis
• A new property of choice-free Petri net systems
• Bounded Petri net synthesis from modal transition systems is undecidable
• Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable
• Presynthesis of bounded choice-free or fork-attribution nets
• Structural reductions revisited
• Synthesis and reengineering of persistent systems
• The power of prime cycles
• Petri Net Synthesis for Restricted Classes of Nets
• \(k\)-bounded Petri net synthesis from modal transition systems
• Conditions for Petri net solvable binary words
• On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency
• Over-approximative Petri net synthesis for restricted subclasses of nets
• Relabelling LTS for Petri net synthesis via solving separation problems
• Reversible computation vs. reversibility in Petri nets
• Bounded choice-free Petri net synthesis: algorithmic issues
• Incremental process discovery using Petri net synthesis
• Synthesis of Petri nets with restricted place-environments: classical and parameterized
• Characterising Petri net solvable binary words
• Analysis of Petri nets and transition systems
• Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
• Simultaneous Petri Net Synthesis
• Lifted structural invariant analysis of Petri net product lines
• Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues
• Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues

This page was built for software: APT