Coverability for order-k nested reset counter systems is F_Ωk-complete.
Compositional choreographies
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Novel compositional theory and software support enable modular design, verification, and reuse of swarm protocols for distributed agent systems.
Register set automata enable deterministic linear-time matching for a class of regexes with single-letter backreferences over finite alphabets via derivative-based transformations from register automata.
citing papers explorer
-
The Complexity of Nested Reset Counter Systems
Coverability for order-k nested reset counter systems is F_Ωk-complete.
-
Compositional Design, Implementation, and Verification of Swarms (Technical Report)
Novel compositional theory and software support enable modular design, verification, and reuse of swarm protocols for distributed agent systems.
-
Towards Efficient Matching of Regexes with Backreferences using Register Set Automata (Technical Report)
Register set automata enable deterministic linear-time matching for a class of regexes with single-letter backreferences over finite alphabets via derivative-based transformations from register automata.