Sciweavers

Share
LICS
2012
IEEE

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

7 years 3 months ago
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
—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 socalled “enriched” nets.
Serge Haddad, Sylvain Schmitz, Philippe Schnoebele
Added 29 Sep 2012
Updated 29 Sep 2012
Type Journal
Year 2012
Where LICS
Authors Serge Haddad, Sylvain Schmitz, Philippe Schnoebelen
Comments (0)
books