*For the most recent entries see the
Petri Nets Newsletter.*

## On the Petri net realization of context-free graphs.

Darondeau, Philippe
In:
*Theoretical Computer Science 258 (1-2)*, pages 573-598.
May 2001.

Abstract:
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.

Keywords:
Graph grammars; Petri nets; Regions; Polyhedral cones; Semi-linear sets.

*Do you need a refined search? Try our search engine
which allows complex field-based queries.*
*Back to the Petri Nets Bibliography*