Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

D-SPACES: Simulating Distributed Information Using Constraint Systems and Order Theory

Stefan Haar 1, 2 Salim Perchy 3 Frank Valencia 3, 4
2 MEXICO - Modeling and Exploitation of Interaction and Concurrency
LSV - Laboratoire Spécification et Vérification [Cachan], Inria Saclay - Ile de France
3 COMETE - Concurrency, Mobility and Transactions
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : This paper introduces D-SPACES, a tool for simulating constraint systems with space and extrusion operators. These formalisms are algebraic structures for modeling the concept of space as an operation over elements (the information). Furthermore, it is possible to specify movement of information from one space to another, either belonging to a different entity (the agents) or somewhere else in the space hierarchy. This tool is coded as a c++11 library providing implementations for; a constraint system (cs), a cs with space functions (scs), and a scs with extrusion functions (scs-e). The interfaces to access each implementation are minimal and thoroughly documented. They also offer property-checking methods for verifying conditions on the cs and functions that are cumbersome to check by hand. Finally, D-SPACES provides an implementation of a specific but common type of a scs-e (a boolean algebra) for easy of access and proof of concept regarding these cs. 1 Motivation and Introduction Systems where data moves across a given structure of information are now commonplace. Applications like social networks, forums, or any other that organizes its information in a defined hierarchy are among these systems. In practice, the nature of this information can be reviews, opinions, news, etc., which in turn belong to a certain entity, e.g. users, agents, applications. This relation of ownership can be conceptualized as space, thus a clear understanding of information in spaces and its movement across them is pertinent to the study of these systems. Treating information as knowledge is one option. Here, we have agents knowing facts [1] and uttering opinions and lies [2]. However, to attain a sufficiently generic concept of space we study declarative formalisms. More specifically we use constraint systems (cs), algebraic structures that operate on elements called
Complete list of metadata

https://hal.inria.fr/hal-01328189
Contributor : Salim Perchy <>
Submitted on : Tuesday, June 7, 2016 - 6:42:49 PM
Last modification on : Tuesday, July 7, 2020 - 11:50:23 AM

File

d-spaces.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01328189, version 1

Citation

Stefan Haar, Salim Perchy, Frank Valencia. D-SPACES: Simulating Distributed Information Using Constraint Systems and Order Theory. 2016. ⟨hal-01328189v1⟩

Share

Metrics

Record views

90

Files downloads

26