Novel compositional theory and software support enable modular design, verification, and reuse of swarm protocols for distributed agent systems.
Fundamental properties of infinite trees
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
New global types for asynchronous multiparty sessions are interpreted as Prime Event Structures with equivalence to session interpretations as Flow Event Structures when typable.
Generalizes graph coverings and unfoldings to weighted versions, proves analogous theorems to Leighton-Norris, and obtains a canonical factorization of universal coverings plus a weighted version of characteristic polynomial factorization.
citing papers explorer
-
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.
-
Global types and event structure semantics for asynchronous multiparty sessions
New global types for asynchronous multiparty sessions are interpreted as Prime Event Structures with equivalence to session interpretations as Flow Event Structures when typable.
-
Unfoldings and coverings of weighted graphs
Generalizes graph coverings and unfoldings to weighted versions, proves analogous theorems to Leighton-Norris, and obtains a canonical factorization of universal coverings plus a weighted version of characteristic polynomial factorization.