@inproceedings{Haddad:2012:OCT:2358958.2359520,
Address = {Washington, DC, USA},
Author = {Haddad, Serge and Schmitz, Sylvain and Schnoebelen, Philippe},
BookTitle = {Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science},
File = {The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets - Haddad, Schmitz, Schnoebelen (0) (0) - a - a - a.pdf},
ISBN = {978-0-7695-4769-5},
Keywords = {Complexity theory, fast-growing hierarchy, formal verification, Petri nets, well-structured systems},
Location = {New Orleans, Louisiana},
Pages = {355--364},
Publisher = {IEEE Computer Society},
Series = {LICS '12},
Title = {The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets},
URL = {http://dx.doi.org/10.1109/LICS.2012.46},
Year = {2012},
acmid = {2359520},
bdsk-url-1 = {http://dx.doi.org/10.1109/LICS.2012.46},
date-added = {2015-08-24 12:52:13 +0000},
date-modified = {2015-08-24 12:52:13 +0000},
numpages = {10},
doi = {10.1109/LICS.2012.46}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A