Deriving Unbounded Petri Nets from Formal Languages - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1998

Deriving Unbounded Petri Nets from Formal Languages

Philippe Darondeau
  • Function : Author
  • PersonId : 833450

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

Dates and versions

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

Identifiers

  • HAL Id : inria-00073324 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More