On the Petri net realization of context-free graphs
Given a finite or infinite labeled transition graph defined by a graph grammar, we show an algorithm that decides whether this graph is isomorphic to the reachable state graph of some finite unlabeled Petri net and that produces in this case a minimal net realizing the graph. (C) 2001 Elsevier Science B.V. All rights reserved.
petri nets graph grammars regions polyhedral cones semi-linear sets