Skip to Main content Skip to Navigation

The Petri net synthesis problem for automatic graphs

Eric Badouel 1 Philippe Darondeau 2
2 S4 - System synthesis and supervision, scenarios
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
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.
Document type :
Complete list of metadatas
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 7:16:47 PM
Last modification on : Tuesday, September 1, 2020 - 3:06:50 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:44:48 PM


  • HAL Id : inria-00071924, version 1


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



Record views


Files downloads