The Petri net synthesis problem for automatic graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2002

The Petri net synthesis problem for automatic graphs

Abstract

Automatic graphs are possibly infinite graphs with a rational presentation by finite automata; they include grids as a particular case, and Sénizergues has shown in a seminal work that they are an extension of deterministic pushdown graphs. Here, we propose a procedure that decides from the automatic presentation of a graph whether it may be realized isomorphically by the reachable state graph of some finite Petri net, with transitions in bijection with labels of edges. As automatic graphs cover more concurrent systems than pushdown graphs, this procedure improves over, and indeed subsumes, the net synthesis procedure studied earlier for pushdown graphs.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4661.pdf (297.74 Ko) Télécharger le fichier

Dates and versions

inria-00071924 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071924 , version 1

Cite

Eric Badouel, Philippe Darondeau. The Petri net synthesis problem for automatic graphs. [Research Report] RR-4661, INRIA. 2002. ⟨inria-00071924⟩
104 View
92 Download

Share

Gmail Facebook X LinkedIn More