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

Serge Haddad, Sylvain Schmitz, Philippe Schnoebelen · 2012 · 2012 27th Annual IEEE Symposium on Logic in Computer Science · DOI 10.1109/lics.2012.46

1 Pith paper cite this work, alongside 19 external citations. Polarity classification is still indexing.

1 Pith paper citing it

19 external citations · Crossref

open at publisher browse 1 citing papers

representative citing papers

cs.FL · 2026-05-14 · unverdicted · novelty 8.0

Coverability for order-k nested reset counter systems is F_Ωk-complete.

Showing 1 of 1 citing paper.

The Complexity of Nested Reset Counter Systems cs.FL · 2026-05-14 · unverdicted · none · ref 32
Coverability for order-k nested reset counter systems is F_Ωk-complete.