The Label Splitting Problem
From MaRDI portal
Publication:4909347
DOI10.1007/978-3-642-35179-2_1zbMath1377.68145OpenAlexW1526072943WikidataQ62039990 ScholiaQ62039990MaRDI QIDQ4909347
Publication date: 13 March 2013
Published in: Transactions on Petri Nets and Other Models of Concurrency VI (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-35179-2_1
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (6)
Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues ⋮ On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets ⋮ Bounded choice-free Petri net synthesis: algorithmic issues ⋮ Enhancing discovered processes with duplicate tasks ⋮ Target-oriented Petri Net Synthesis ⋮ Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable
This page was built for publication: The Label Splitting Problem
