Reasoning about distributed knowledge of groups with infinitely many agents

Michell Guzmán, Sophia Knight, Santiago Quintero, Sergio Ramírez, Camilo Rueda, Frank Valencia

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

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 languageEnglish (US)
Title of host publication30th International Conference on Concurrency Theory, CONCUR 2019
EditorsWan Fokkink, Rob van Glabbeek
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771214
DOIs
StatePublished - Aug 2019
Event30th International Conference on Concurrency Theory, CONCUR 2019 - Amsterdam, Netherlands
Duration: Aug 27 2019Aug 30 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume140
ISSN (Print)1868-8969

Conference

Conference30th International Conference on Concurrency Theory, CONCUR 2019
CountryNetherlands
CityAmsterdam
Period8/27/198/30/19

    Fingerprint

Keywords

  • Algebraic modeling
  • Distributed knowledge
  • Infinitely many agents
  • Reasoning about groups
  • Reasoning about space

Cite this

Guzmán, M., Knight, S., Quintero, S., Ramírez, S., Rueda, C., & Valencia, F. (2019). Reasoning about distributed knowledge of groups with infinitely many agents. In W. Fokkink, & R. van Glabbeek (Eds.), 30th International Conference on Concurrency Theory, CONCUR 2019 [29] (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 140). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CONCUR.2019.29