Investigating The Algebraic Structure of Dihomotopy Types

This presentation is the sequel of a paper published in GETCO'00 proceedings where a research program to construct an appropriate algebraic setting for the study of deformations of higher dimensional automata was sketched. This paper focuses precisely on detailing some of its aspects. The main idea is that the category of homotopy types can be embedded in a new category of dihomotopy types, the embedding being realized by the Globe functor. In this latter category, isomorphism classes of objects are exactly higher dimensional automata up to deformations leaving invariant their computer scientific properties as presence or not of deadlocks (or everything similar or related). Some hints to study the algebraic structure of dihomotopy types are given, in particular a rule to decide whether a statement/notion concerning dihomotopy types is or not the lifting of another statement/notion concerning homotopy types. This rule does not enable to guess what is the lifting of a given notion/statement, it only enables to make the verification, once the lifting has been found.Comment: 28 pages ; LaTeX2e + 4 figures ; Expository paper ; Minor typos corrections ; To appear in GETCO'01 proceeding

A model category for the homotopy theory of concurrency

We construct a cofibrantly generated model structure on the category of flows such that any flow is fibrant and such that two cofibrant flows are homotopy equivalent for this model structure if and only if they are S-homotopy equivalent. This result provides an interpretation of the notion of S-homotopy equivalence in the framework of model categories.Comment: 45 pages ; 4 figure ; First paper corresponding to the content of math.AT/0201252 ; final versio

Labelled transition systems as a Stone space

A fully abstract and universal domain model for modal transition systems and refinement is shown to be a maximal-points space model for the bisimulation quotient of labelled transition systems over a finite set of events. In this domain model we prove that this quotient is a Stone space whose compact, zero-dimensional, and ultra-metrizable Hausdorff topology measures the degree of bisimilarity such that image-finite labelled transition systems are dense. Using this compactness we show that the set of labelled transition systems that refine a modal transition system, its ''set of implementations'', is compact and derive a compactness theorem for Hennessy-Milner logic on such implementation sets. These results extend to systems that also have partially specified state propositions, unify existing denotational, operational, and metric semantics on partial processes, render robust consistency measures for modal transition systems, and yield an abstract interpretation of compact sets of labelled transition systems as Scott-closed sets of modal transition systems.Comment: Changes since v2: Metadata updat

Formal Relationships Between Geometrical and Classical Models for Concurrency

A wide variety of models for concurrent programs has been proposed during the past decades, each one focusing on various aspects of computations: trace equivalence, causality between events, conflicts and schedules due to resource accesses, etc. More recently, models with a geometrical flavor have been introduced, based on the notion of cubical set. These models are very rich and expressive since they can represent commutation between any bunch of events, thus generalizing the principle of true concurrency. While they seem to be very promising - because they make possible the use of techniques from algebraic topology in order to study concurrent computations - they have not yet been precisely related to the previous models, and the purpose of this paper is to fill this gap. In particular, we describe an adjunction between Petri nets and cubical sets which extends the previously known adjunction between Petri nets and asynchronous transition systems by Nielsen and Winskel