Characterizing Behavioural Congruences for Petri Nets
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Model Checking as Constraint Solving
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
On context-free sets of graphs and their monadic second-order theory
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
A representation of graphs by algebraic expressions and its use for graph rewriting systems
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Unifying Petri Net Semantics with Token Flows
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Finite automata on unranked and unordered DAGs
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Some examples of semi-rational DAG languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
| Hi-index | 0.00 |
We call a set of DAGs (directed acyclic graphs) semi-rational if it is accepted by a Petri net. It is shown that the class of semi-rational sets of DAGs coincides with the synchronization closure of Courcelles class of recognizable sets of unranked, unordered trees (or forests).