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.
Type de document :
[Research Report] RR-3365, INRIA. 1998
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 12:32:39
Dernière modification le : mercredi 16 mai 2018 - 11:23:04
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:42:21



  • HAL Id : inria-00073324, version 1


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



Consultations de la notice


Téléchargements de fichiers