Abstract
Region theory, as initiated by Ehrenfeucht and Rozenberg, allows the characterisation of the class of Petri net synthesisable finite labelled transition systems. Regions are substructures of a transition system which come in two varieties: ones solving event/state separation problems, and ones solving state separation problems. Linear inequation systems can be used in order to check the solvability of these separation problems. In the present paper, the class of finite labelled transition systems in which all state separation problems are solvable shall be characterised graph-theoretically, rather than linear-algebraically.
Author supplied keywords
Cite
CITATION STYLE
Best, E., Devillers, R., & Schlachter, U. (2017). A graph-theoretical characterisation of state separation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10139 LNCS, pp. 163–175). Springer Verlag. https://doi.org/10.1007/978-3-319-51963-0_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
