APT

swMATH23176MaRDI QIDQ34960

No author found.

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

Related Items (29)

Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues ⋮ Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues ⋮ Over-approximative Petri net synthesis for restricted subclasses of nets ⋮ Reversible Computation vs. Reversibility in Petri Nets ⋮ Unnamed Item ⋮ A New Property of Choice-Free Petri Net Systems ⋮ Structural Reductions Revisited ⋮ Incremental Process Discovery using Petri Net Synthesis ⋮ Unnamed Item ⋮ Simultaneous Petri Net Synthesis ⋮ Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems ⋮ Synthesis and reengineering of persistent systems ⋮ Bounded choice-free Petri net synthesis: algorithmic issues ⋮ Relabelling LTS for Petri net synthesis via solving separation problems ⋮ 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 ⋮ Unnamed Item ⋮ Target-oriented Petri Net Synthesis ⋮ k-Bounded Petri Net Synthesis from Modal Transition Systems. ⋮ Lifted structural invariant analysis of Petri net product lines ⋮ Conditions for Petri Net Solvable Binary Words ⋮ 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 ⋮ 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

This page was built for software: APT