Results 1 
6 of
6
SOME GEOMETRIC PERSPECTIVES IN CONCURRENCY THEORY
 HOMOLOGY, HOMOTOPY AND APPLICATIONS, VOL.5(2), 2003, PP.95–136
, 2003
"... Concurrency, i.e., the domain in computer science which deals with parallel (asynchronous) computations, has very strong links with algebraic topology; this is what we are developing in this paper, giving a survey of “geometric” models for concurrency. We show that the properties we want to prove on ..."
Abstract

Cited by 42 (3 self)
 Add to MetaCart
Concurrency, i.e., the domain in computer science which deals with parallel (asynchronous) computations, has very strong links with algebraic topology; this is what we are developing in this paper, giving a survey of “geometric” models for concurrency. We show that the properties we want to prove on concurrent systems are stable under some form of deformation, which is almost homotopy. In fact, as the “direction ” of time matters, we have to allow deformation only as long as we do not reverse the direction of time. This calls for a new homotopy theory: “directed ” or dihomotopy. We develop some of the geometric intuition behind this theory and give some hints about the algebraic objects one can associate with it (in particular homology groups). For some historic as well as for some deeper reasons, the theory is at a stage where there is a nice blend between cubical, ωcategorical and topological techniques.
Geometry and Concurrency: A User's Guide
, 2000
"... Introduction "Geometry and Concurrency" is not yet a wellestablished domain of research, but is rather made of a collection of seemingly related techniques, algorithms and formalizations, coming from different application areas, accumulated over a long period of time. There is currently ..."
Abstract

Cited by 29 (7 self)
 Add to MetaCart
Introduction "Geometry and Concurrency" is not yet a wellestablished domain of research, but is rather made of a collection of seemingly related techniques, algorithms and formalizations, coming from different application areas, accumulated over a long period of time. There is currently a certain amount of effort made for unifying these (in particular see the article (Gunawardena, 1994)), following the workshop "New Connections between Computer Science and Mathematics" held at the Newton Institute in Cambridge, England in November 1995 (and sponsored by HP/BRIMS). More recently, the first workshop on the very same subject has been held in Aalborg, Denmark (see http://www.math.auc.dk/~raussen/admin/workshop/workshop.html where the articles of this issue, among others, have been first sketched. But what is "Geometry and Concurrency" composed of then? It is an area of research made of techniques which use geometrical reasoning for describing and solving problems
Geometric aspects of multiagent systems
 Electron. Notes Theoret. Comput. Sci
, 2003
"... Recent advances in Multiagent Systems (MAS) and Epistemic Logic within Distributed Systems Theory, have used various combinatorial structures that model both the geometry of the systems and the Kripke model structure of models for the logic. Examining one of the simpler versions of these models, int ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Recent advances in Multiagent Systems (MAS) and Epistemic Logic within Distributed Systems Theory, have used various combinatorial structures that model both the geometry of the systems and the Kripke model structure of models for the logic. Examining one of the simpler versions of these models, interpreted systems, and the related Kripke semantics of the logic S5n (an epistemic logic with nagents), the similarities with the geometric / homotopy theoretic structure of groupoid atlases is striking. These latter objects arise in problems within algebraic Ktheory, an area of algebra linked to the study of decomposition and normal form theorems in linear algebra. They have a natural well structured notion of path and constructions of path objects, etc., that yield a rich homotopy theory. In this paper, we examine what an geometric analysis of the model may tell us of the MAS. Also the analogous notion of path will be analysed for interpreted systems and S5nKripke models, and is compared to the notion of ‘run ’ as used with MASs. Further progress may need adaptions to handle S4n rather than S5n and to use directed homotopy rather than standard ‘reversible ’ homotopy.
A Model for Knowledge Representation in Distributed Systems
, 2002
"... this article, we present a simplified formalism of distributed systems in order to show some concepts which we think are important in the study of the flow of information between different parts or agents of a system. Then, we use those 1 basic concepts and generalize them to define an algebraic fr ..."
Abstract
 Add to MetaCart
this article, we present a simplified formalism of distributed systems in order to show some concepts which we think are important in the study of the flow of information between different parts or agents of a system. Then, we use those 1 basic concepts and generalize them to define an algebraic framework for formalizing distributed systems. Finally, we study the logical structure of this framework and show that in this formalism, the distributed systems form a model for the intuitionistic modal logic IS4+KV
University of Wales Bangor,
"... Recent advances in Multiagent Systems (MAS) and Epistemic Logic within Distributed Systems Theory, have used various combinatorial structures that model both the geometry of the systems and the Kripke model structure of models for the logic. Examining one of the simpler versions of these models, int ..."
Abstract
 Add to MetaCart
Recent advances in Multiagent Systems (MAS) and Epistemic Logic within Distributed Systems Theory, have used various combinatorial structures that model both the geometry of the systems and the Kripke model structure of models for the logic. Examining one of the simpler versions of these models, interpreted systems, and the related Kripke semantics of the logic S5n (an epistemic logic with nagents), the similarities with the geometric / homotopy theoretic structure of groupoid atlases is striking. These latter objects arise in problems within algebraic Ktheory, an area of algebra linked to the study of decomposition and normal form theorems in linear algebra. They have a natural well structured notion of path and constructions of path objects, etc., that yield a rich homotopy theory. In this paper, we examine what an geometric analysis of the model may tell us of the MAS. Also the analogous notion of path will be analysed for interpreted systems and S5nKripke models, and is compared to the notion of ‘run ’ as used with MASs. Further progress may need adaptions to handle S4n rather than S5n and to use directed homotopy rather than standard ‘reversible ’ homotopy. Geometric Aspects of Multiagent Systems