APT

swMATH23176MaRDI QIDQ34960FDOQ34960

Author name not available (Why is that?)

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

Cited In (29)

• Incremental Process Discovery using Petri Net Synthesis
• k-Bounded Petri Net Synthesis from Modal Transition Systems.
• Synthesis of (choice-free) reset nets
• Title not available (Why is that?)
• Conditions for Petri Net Solvable Binary Words
• The Complexity of Synthesis of b-Bounded Petri Nets
• 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
• Synthesis and reengineering of persistent systems
• Petri Net Synthesis for Restricted Classes of Nets
• Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems
• Title not available (Why is that?)
• Over-approximative Petri net synthesis for restricted subclasses of nets
• Relabelling LTS for Petri net synthesis via solving separation problems
• Bounded choice-free Petri net synthesis: algorithmic issues
• Synthesis of Petri nets with restricted place-environments: classical and parameterized
• The Power of Prime Cycles
• Symbolic and Structural Model-Checking
• Target-oriented Petri Net Synthesis
• A New Property of Choice-Free Petri Net Systems
• Title not available (Why is that?)
• Reversible Computation vs. Reversibility in Petri Nets
• Characterising Petri Net Solvable Binary Words
• Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
• Simultaneous Petri Net Synthesis
• Structural Reductions Revisited
• 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