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

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00793811
Contributor : Sylvain Schmitz <>
Submitted on : Saturday, February 23, 2013 - 12:00:45 PM
Last modification on : Thursday, January 11, 2018 - 6:20:13 AM
Long-term archiving on: Sunday, April 2, 2017 - 4:43:20 AM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

183

Files downloads

243