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. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1007/978-3-319-51963-0_13 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Cyclic behaviour,Labelled transition systems,Persistent systems,System synthesis | Transition system,Graph,Discrete mathematics,Combinatorics,Petri net,Computer science,Inequation | Conference |
Volume | ISSN | Citations |
10139 | 0302-9743 | 1 |
PageRank | References | Authors |
0.43 | 5 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Eike Best | 1 | 379 | 35.97 |
Raymond Devillers | 2 | 742 | 76.40 |
Uli Schlachter | 3 | 26 | 5.95 |