Javascript must be enabled to continue!
A Spatial Logic for Simplicial Models
View through CrossRef
Collective Adaptive Systems often consist of many heterogeneous components
typically organised in groups. These entities interact with each other by
adapting their behaviour to pursue individual or collective goals. In these
systems, the distribution of these entities determines a space that can be
either physical or logical. The former is defined in terms of a physical
relation among components. The latter depends on logical relations, such as
being part of the same group. In this context, specification and verification
of spatial properties play a fundamental role in supporting the design of
systems and predicting their behaviour. For this reason, different tools and
techniques have been proposed to specify and verify the properties of space,
mainly described as graphs. Therefore, the approaches generally use model
spatial relations to describe a form of proximity among pairs of entities.
Unfortunately, these graph-based models do not permit considering relations
among more than two entities that may arise when one is interested in
describing aspects of space by involving interactions among groups of entities.
In this work, we propose a spatial logic interpreted on simplicial complexes.
These are topological objects, able to represent surfaces and volumes
efficiently that generalise graphs with higher-order edges. We discuss how the
satisfaction of logical formulas can be verified by a correct and complete
model checking algorithm, which is linear to the dimension of the simplicial
complex and logical formula. The expressiveness of the proposed logic is
studied in terms of the spatial variants of classical bisimulation and
branching bisimulation relations defined over simplicial complexes.
Centre pour la Communication Scientifique Directe (CCSD)
Title: A Spatial Logic for Simplicial Models
Description:
Collective Adaptive Systems often consist of many heterogeneous components
typically organised in groups.
These entities interact with each other by
adapting their behaviour to pursue individual or collective goals.
In these
systems, the distribution of these entities determines a space that can be
either physical or logical.
The former is defined in terms of a physical
relation among components.
The latter depends on logical relations, such as
being part of the same group.
In this context, specification and verification
of spatial properties play a fundamental role in supporting the design of
systems and predicting their behaviour.
For this reason, different tools and
techniques have been proposed to specify and verify the properties of space,
mainly described as graphs.
Therefore, the approaches generally use model
spatial relations to describe a form of proximity among pairs of entities.
Unfortunately, these graph-based models do not permit considering relations
among more than two entities that may arise when one is interested in
describing aspects of space by involving interactions among groups of entities.
In this work, we propose a spatial logic interpreted on simplicial complexes.
These are topological objects, able to represent surfaces and volumes
efficiently that generalise graphs with higher-order edges.
We discuss how the
satisfaction of logical formulas can be verified by a correct and complete
model checking algorithm, which is linear to the dimension of the simplicial
complex and logical formula.
The expressiveness of the proposed logic is
studied in terms of the spatial variants of classical bisimulation and
branching bisimulation relations defined over simplicial complexes.
Related Results
Simplicial polygroups and the generalized Moore complexes
Simplicial polygroups and the generalized Moore complexes
A simplicial group is a simplicial object in the category of groups. A very nice application of simplicial group which is simplicial polygroup is given in this paper. Using polygro...
InvMap and Witness Simplicial Variational Auto-Encoders
InvMap and Witness Simplicial Variational Auto-Encoders
Variational Auto-Encoders (VAEs) are deep generative models used for unsupervised learning, however their standard version is not topology-aware in practice since the data topology...
On simple maps
On simple maps
This chapter deals with simple maps of finite simplicial sets, along with some of their formal properties. It begins with a discussion of simple maps of simplicial sets, presenting...
Rationality and Logic
Rationality and Logic
An argument that logic is intrinsically psychological and human psychology is intrinsically logical, and that the connection between human rationality and logic is both constitutiv...
Greek and Roman Logic
Greek and Roman Logic
In ancient philosophy, there is no discipline called “logic” in the contemporary sense of “the study of formally valid arguments.” Rather, once a subfield of philosophy comes to be...
A logic of defeasible argumentation: Constructing arguments in justification logic
A logic of defeasible argumentation: Constructing arguments in justification logic
In the 1980s, Pollock’s work on default reasons started the quest in the AI community for a formal system of defeasible argumentation. The main goal of this paper is to provide a l...
Graph Decotnpositions
Graph Decotnpositions
Abstract
Graph Decompositions is the first book on a topic that belongs mainly to infinite graph theory. It offers a complete account of the theory of simplicial dec...
An approximation to Čech complex using median of triangles for computing Betti numbers of some point cloud data
An approximation to Čech complex using median of triangles for computing Betti numbers of some point cloud data
An approach has been developed to create an approximated simplicial complex in between the Vietoris-Rips complex and the Čech complex using median of triangles for computing Betti ...

