%0 Report %T On the Petri Net Realization of Context-Free Graphs %+ Parallelism and Graphs (PARAGRAPHE) %A Darondeau, Philippe %N RR-3674 %I INRIA %8 1999 %D 1999 %K INFINITE GRAPHS %K GRAPH GRAMMARS %K PETRI NETS %K REGIONS %K SEPARATION %K POLYHEDRAL CONES %K SEMI-LINEAR SETS %Z Computer Science [cs]/Other [cs.OH]Reports %X 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. %G English %2 https://inria.hal.science/inria-00072999/document %2 https://inria.hal.science/inria-00072999/file/RR-3674.pdf %L inria-00072999 %U https://inria.hal.science/inria-00072999 %~ EC-PARIS %~ UNIV-RENNES1 %~ CNRS %~ INRIA %~ INSA-RENNES %~ INRIA-RENNES %~ IRISA %~ INRIA-RRRT %~ IRISA_SET %~ TESTALAIN1 %~ INRIA2 %~ UR1-HAL %~ LARA %~ UR1-MATH-STIC %~ UR1-UFR-ISTIC %~ TEST-UNIV-RENNES %~ TEST-UR-CSS %~ UNIV-RENNES %~ INRIA-RENGRE %~ INRIA-300009 %~ INSA-GROUPE %~ UR1-MATH-NUM