Abstract
This paper discusses the following results: that bounded Petri nets can be transformed into pomset-equivalent safe nets; that boundedmarked graphs can be transformed into step-language-equivalent safe marked graphs; that safe labelled marked graphs can be transformed into τ–free safe labelled marked graphs; and that marked graphs can be separated. The paper also lists some open problems that have arisen in this context.
Get full access to this article
View all access options for this article.