Relabelling LTS for Petri net synthesis via solving separation problems

DOI10.1007/978-3-662-60651-3_9zbMath1464.68261OpenAlexW2990497020MaRDI QIDQ2032917

Harro Wimmel, Uli Schlachter

Publication date: 14 June 2021

Full work available at URL: https://doi.org/10.1007/978-3-662-60651-3_9

zbMATH Keywords

regionsPetri netslabelled transition systemsseparation problemssystem synthesislabel splitting

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues ⋮ On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets ⋮ Unnamed Item ⋮ Target-oriented Petri Net Synthesis ⋮ Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable

Uses Software

• APT

This page was built for publication: Relabelling LTS for Petri net synthesis via solving separation problems