Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable

DOI10.1007/978-3-030-76983-3_13zbMath1489.68168OpenAlexW3172765973MaRDI QIDQ2117174

Ronny Tredup

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-76983-3_13

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues ⋮ On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets

Uses Software

• APT

Cites Work

• Petri net synthesis
• Distributing finite automata through Petri net synthesis
• Relabelling LTS for Petri net synthesis via solving separation problems
• Synthesis and reengineering of persistent systems
• Process Mining
• Petri Net Distributability
• Logic Synthesis for Asynchronous Controllers and Interfaces
• The Label Splitting Problem
• Polynomial algorithms for the synthesis of bounded nets

This page was built for publication: Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable