A graph grammar representation of nonsequential processes

  • Wolfgang Reisig
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 100)


A marked Petri net may be considered as a finite description of an (in general) infinite set of nonsequential processes. Such a process is represented as a labelled graph; thus the process set of a marked net is a graph language. This language is produced by a graph grammar which can be derived from the net. This construction yields a bijection between the set of marked Petri nets and a distinguished class of graph grammars.


Label Graph Graph Grammar Reachability Problem Graph Language Firing Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. Nagl.: Graph-Grammatiken.— Vieweg Verlag WiesbadenGoogle Scholar
  2. [2]
    C.A. Petri: Nicht-sequentielle Prozesse.— GMD-ISF Interner Bericht 76-6Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Wolfgang Reisig
    • 1
  1. 1.Lehrstuhl für Informatik II RWTH AachenAachen

Personalised recommendations