The Ordinal Recursive Complexity of of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

The Ordinal Recursive Complexity of of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets

Résumé

We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of the main decidable properties (safety, termination, regular simulation, etc.) of these models. Since these new lower bounds match the upper bounds that one can derive from wqo theory, they precisely characterise the computational power of these so-called "enriched" nets.
Fichier principal
Vignette du fichier
main.pdf (569.58 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00793811 , version 1 (23-02-2013)

Identifiants

Citer

Serge Haddad, Sylvain Schmitz, Philippe Schnoebelen. The Ordinal Recursive Complexity of of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets. 27th ACM/IEEE Symposium on Logic in Computer Science, Jun 2012, Dubrovnik, Croatia. pp.355--364, ⟨10.1109/LICS.2012.46⟩. ⟨hal-00793811⟩
117 Consultations
219 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More