Title resolution pending

Leroux, J · 2019 · arXiv 2019.878579

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

representative citing papers

The Complexity of Nested Reset Counter Systems

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

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

Structural Liveness of Conservative Petri Nets

cs.LO · 2025-03-14 · unverdicted · novelty 7.0

Structural liveness of conservative Petri nets is EXPSPACE-complete because minimal live markings are at most doubly exponential in net size.

citing papers explorer

Showing 2 of 2 citing papers.

The Complexity of Nested Reset Counter Systems cs.FL · 2026-05-14 · unverdicted · none · ref 24
Coverability for order-k nested reset counter systems is F_Ωk-complete.
Structural Liveness of Conservative Petri Nets cs.LO · 2025-03-14 · unverdicted · none · ref 20
Structural liveness of conservative Petri nets is EXPSPACE-complete because minimal live markings are at most doubly exponential in net size.

Title resolution pending

fields

years

verdicts

representative citing papers

citing papers explorer