Skip to Main content Skip to Navigation

Deriving Unbounded Petri Nets from Formal Languages

Philippe Darondeau 1
1 PARAGRAPHE - Parallelism and Graphs
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : We propose decision procedures based on regions for two problems on pure unbounded Petri nets with injective labelling. One problem is to construct nets from incomplete specifications, given by pairs of regular languages that impose respectively upper and lower bounds on their expected behaviours. The second problem is to derive equivalent nets from deterministic pushdown automata, thus exhibiting their hidden concurrency.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 12:32:39 PM
Last modification on : Thursday, February 11, 2021 - 2:48:05 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:42:21 PM


  • HAL Id : inria-00073324, version 1


Philippe Darondeau. Deriving Unbounded Petri Nets from Formal Languages. [Research Report] RR-3365, INRIA. 1998. ⟨inria-00073324⟩



Record views


Files downloads