Skip to main content
Conference Proceedings

A comparison between Petri-nets and graph grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1981) 100 LNCS 306-317
DOI: 10.1007/3-540-10291-4_22
36Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A graph grammar is constructed from a given Petri-net so that direct derivation steps in the grammar correspond to firings of transitions in the net. This close relationship between Petri-nets and graph grammars allows to compare the concurrency concepts of the two theories. As an illustrating example the well-known dining-philosophers problem is discussed.

Cite

CITATION STYLE

APA

Kreowski, H. J. (1981). A comparison between Petri-nets and graph grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 100 LNCS, pp. 306–317). Springer Verlag. https://doi.org/10.1007/3-540-10291-4_22

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