Reasoning about distributed information with infinitely many agents

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

doi:10.1016/j.jlamp.2021.100674

Cited by 2 publications

(12 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [9] we introduced the theory of group space functions ∆ I : Con → Con to reason about information distributed among the members of a potentially infinite group I. We refer to ∆ I as the distributed space of group I.…”

Section: Distributed Information Let Us Consider Again the Sccp Reduc...mentioning

confidence: 99%

“…In [9] we extended scs to allow arbitrary, possibly infinite, sets of agents. A spatial cs is a cs with a possibly infinite group of agents each having a space function.…”

Section: Space and Beliefsmentioning

confidence: 99%

“…In [9] we introduced the notion of collective information of a group of agents. Roughly speaking, the distributed (or collective) information of a group I is the join of each piece of information that resides in the space of some i ∈ I.…”

Section: Groups and Distributed Knowledgementioning

confidence: 99%

“…The above example may suggest that the distributed information can be obtained by joining individual local information derived from c. Individual information of an agent i can be characterized as the iprojection of c defined thus: Definition 6.2 (Agent and Join Projections [9]). Let C = (Con, ⊑, (s i ) i∈G ) be an scs.…”

Section: Groups and Distributed Knowledgementioning

confidence: 99%

“…These structures single out the notions we previously discussed: Namely, space, beliefs, and distributed information of potentially infinite groups. In this paper we will describe the theory of scs and highlight its main results from [8,10,11,12,9].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Semantic Structures for Spatially-Distributed Multi-Agent Systems

Valencia

2019

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Spatial constraint systems (scs) are semantic structures for reasoning about spatial and epistemic information in concurrent systems. They have been used to reason about beliefs, lies, and group epistemic behaviour inspired by social networks. They have also been used for proving new results about modal logics and giving semantics to process calculi. In this paper we will discuss the theory and main results about scs. * Frank Valencia has been partially supported by the ECOS-NORD project FACTS (C19M03).

show abstract

Section: Distributed Information Let Us Consider Again the Sccp Reduc...mentioning

confidence: 99%

“…In [9] we extended scs to allow arbitrary, possibly infinite, sets of agents. A spatial cs is a cs with a possibly infinite group of agents each having a space function.…”

Section: Space and Beliefsmentioning

confidence: 99%

Section: Groups and Distributed Knowledgementioning

confidence: 99%

Section: Groups and Distributed Knowledgementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Semantic Structures for Spatially-Distributed Multi-Agent Systems

Valencia

2019

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

A Rewriting Logic Approach to Stochastic and Spatial Constraint System Specification and Verification

Romero¹,

Ramírez²,

Rocha³

et al. 2019

Preprint

Self Cite

View full text Add to dashboard Cite

This paper addresses the issue of specifying, simulating, and verifying reactive systems in rewriting logic. It presents an executable semantics for probabilistic, timed, and spatial concurrent constraint programming -here called stochastic and spatial concurrent constraint systems (sscc)-in the rewriting logic semantic framework. The approach is based on an enhanced and generalized model of concurrent constraint programming (CCP) where computational hierarchical spaces can be assigned to belong to agents. The executable semantics faithfully represents and operationally captures the highly concurrent nature, uncertain behavior, and spatial and epistemic characteristics of reactive systems with flow of information. In sscc, timing attributes -represented by stochastic duration-can be associated to processes, and exclusive and independent probabilistic choice is also supported. SMT solving technology, available from the Maude system, is used to realize the underlying constraint system of sscc with quantifier-free formulas over integers and reals. This results in a fully executable real-time symbolic specification that can be used for quantitative analysis in the form of statistical model checking. The main features and capabilities of sscc are illustrated with examples throughout the paper. This contribution is part of a larger research effort aimed at making available formal analysis techniques and tools, mathematically founded on the CCP approach, to the research community.

show abstract

Reasoning about distributed information with infinitely many agents

Cited by 2 publications

References 26 publications

Semantic Structures for Spatially-Distributed Multi-Agent Systems

Semantic Structures for Spatially-Distributed Multi-Agent Systems

A Rewriting Logic Approach to Stochastic and Spatial Constraint System Specification and Verification

Contact Info

Product

Resources

About