A Graph-Theoretical Characterisation of State Separation

DOI10.1007/978-3-319-51963-0_13zbMath1444.68112OpenAlexW2570457720MaRDI QIDQ2971132

Uli Schlachter, Eike Best, Raymond Devillers

Publication date: 4 April 2017

Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-51963-0_13

zbMATH Keywords

labelled transition systemssystem synthesiscyclic behaviourpersistent systems

Mathematics Subject Classification ID

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

Related Items (5)

A New Property of Choice-Free Petri Net Systems ⋮ Automated Repair of Process Models Using Non-local Constraints ⋮ Presynthesis of bounded choice-free or fork-attribution nets ⋮ Target-oriented Petri Net Synthesis ⋮ Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory

Cites Work

• Unnamed Item
• Petri net synthesis
• A decomposition theorem for finite persistent transition systems
• Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets
• Petri nets with individual tokens
• The Power of Prime Cycles
• Conditions for Petri Net Solvable Binary Words

This page was built for publication: A Graph-Theoretical Characterisation of State Separation