Spatial constraint systems (scs) are semantic structures for reasoning about spatial and epistemic information in concurrent systems. We develop the theory of scs to reason about the distributed information of potentially infinite groups. We characterize the notion of distributed information of a group of agents as the infimum of the set of join-preserving functions that represent the spaces of the agents in the group. We provide an alternative characterization of this notion as the greatest family of join-preserving functions that satisfy certain basic properties. We show compositionality results for these characterizations and conditions under which information that can be obtained by an infinite group can also be obtained by a finite group. Finally, we provide algorithms that compute the distributive group information of finite groups.
|Original language||English (US)|
|Title of host publication||30th International Conference on Concurrency Theory, CONCUR 2019|
|Editors||Wan Fokkink, Rob van Glabbeek|
|Publisher||Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing|
|State||Published - Aug 2019|
|Event||30th International Conference on Concurrency Theory, CONCUR 2019 - Amsterdam, Netherlands|
Duration: Aug 27 2019 → Aug 30 2019
|Name||Leibniz International Proceedings in Informatics, LIPIcs|
|Conference||30th International Conference on Concurrency Theory, CONCUR 2019|
|Period||8/27/19 → 8/30/19|
Bibliographical noteFunding Information:
Funding This work have been partially supported by the ECOS-NORD project FACTS (C19M03) and the Colciencias project CLASSIC (125171250031).
© Michell Guzmán, Sophia Knight, Santiago Quintero, Sergio Ramírez, Camilo Rueda, and Frank Valencia.
- Algebraic modeling
- Distributed knowledge
- Infinitely many agents
- Reasoning about groups
- Reasoning about space