On the Petri Net Realization of Context-Free Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1999

On the Petri Net Realization of Context-Free Graphs

Philippe Darondeau
  • Function : Author
  • PersonId : 833450

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.
Fichier principal
Vignette du fichier
RR-3674.pdf (440.84 Ko) Télécharger le fichier

Dates and versions

inria-00072999 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072999 , version 1

Cite

Philippe Darondeau. On the Petri Net Realization of Context-Free Graphs. [Research Report] RR-3674, INRIA. 1999. ⟨inria-00072999⟩
45 View
168 Download

Share

Gmail Facebook X LinkedIn More