Skip to main content
Conference Proceedings

Semi-rational sets of DAGs

Lecture Notes in Computer Science (2005) 3572 385-396
DOI: 10.1007/11505877_34
3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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). © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Priese, L. (2005). Semi-rational sets of DAGs. In Lecture Notes in Computer Science (Vol. 3572, pp. 385–396). Springer Verlag. https://doi.org/10.1007/11505877_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free