License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2019.29
URN: urn:nbn:de:0030-drops-109314
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10931/
Go to the corresponding LIPIcs Volume Portal

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

Reasoning About Distributed Knowledge of Groups with Infinitely Many Agents

pdf-format:
LIPIcs-CONCUR-2019-29.pdf (0.6 MB)

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.

BibTeX - Entry

@InProceedings{guzmn_et_al:LIPIcs:2019:10931,
  author =	{Michell Guzm{\'a}n and Sophia Knight and Santiago Quintero and Sergio Ram{\'\i}rez and Camilo Rueda and Frank Valencia},
  title =	{{Reasoning About Distributed Knowledge of Groups with Infinitely Many Agents}},
  booktitle =	{30th International Conference on Concurrency Theory (CONCUR 2019)},
  pages =	{29:1--29:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-121-4},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{140},
  editor =	{Wan Fokkink and Rob van Glabbeek},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10931},
  URN =		{urn:nbn:de:0030-drops-109314},
  doi =		{10.4230/LIPIcs.CONCUR.2019.29},
  annote =	{Keywords: Reasoning about Groups, Distributed Knowledge, Infinitely Many Agents, Reasoning about Space, Algebraic Modeling}
}

Keywords: Reasoning about Groups, Distributed Knowledge, Infinitely Many Agents, Reasoning about Space, Algebraic Modeling
Collection: 30th International Conference on Concurrency Theory (CONCUR 2019)
Issue Date: 2019
Date of publication: 20.08.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI