par Best, Eike 
;Devillers, Raymond ;Schlachter, Uli
Référence Lecture notes in computer science, 10139 LNCS, page (163-175)
Publication Publié, 2017
;Devillers, Raymond ;Schlachter, UliRéférence Lecture notes in computer science, 10139 LNCS, page (163-175)
Publication Publié, 2017
Article révisé par les pairs
| Résumé : | 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. |
