The label splitting problem

DOI10.1007/978-3-642-35179-2_1zbMATH Open1377.68145OpenAlexW1526072943WikidataQ62039990 ScholiaQ62039990MaRDI QIDQ4909347FDOQ4909347

Authors: Josep Carmona 

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

Recommendations

• Relabelling LTS for Petri net synthesis via solving separation problems
• A geometric characterisation of event/state separation
• A graph-theoretical characterisation of state separation
• scientific article; zbMATH DE number 1302048
• Applying regions

Mathematics Subject Classification ID

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

Cited In (7)

• Target-oriented Petri net synthesis
• Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable
• Bounded choice-free Petri net synthesis: algorithmic issues
• On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
• Enhancing discovered processes with duplicate tasks
• A Labelled System for IPL with Variable Splitting
• Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues

This page was built for publication: The label splitting problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909347)