We show how parallel composition of higher-dimensional automata (HDA) can be expressed categorically in the spirit of Winskel & Nielsen. Employing the notion of computation path introduced by van Glabbeek, we define a new notion of bisimulation of HDA using open maps. We derive a connection between computation paths and carrier sequences of dipaths and show that bisimilarity of HDA can be decided by the use of geometric techniques
Parallel processes in concurrency theory can be modelled in a geometric framework. A convenient mode...
We provide the basics of a 2-dimensional theory of automata on series-parallel biposets. We define r...
In this paper I compare the expressive power of several models of concurrency based on their ability...
Abstract. We show how parallel composition of higher-dimensional au-tomata (HDA) can be expressed ca...
We show how parallel compostition of higher-dimensional automata (HDA) can be expressed categoricall...
International audienceOne of the popular notions of equivalence for non-interleaving concurrent syst...
We propose a generalization of higher-dimensional automata, partial HDA. Unlike HDA, and also extend...
International audienceWe propose a generalization of higher-dimensional automata, partial HDA. Unlik...
We introduce a new category of higher-dimensional automata in which the morphisms are functional hom...
Abstract. This paper contributes to the general understanding of the geometrical model of concurrenc...
It is shown that there exists a hereditary history-preserving bisimulation between a higher-dimensio...
AbstractWe show that history-preserving bisimilarity for higher-dimensional automata has a simple ch...
Higher-dimensional automata constitute a very expressive model for concurrent systems. In this pape...
This paper contributes to the general understanding of the geometrical model of concurrency that was...
AbstractAn abstract definition of bisimulation is presented. It makes possible a uniform definition ...
Parallel processes in concurrency theory can be modelled in a geometric framework. A convenient mode...
We provide the basics of a 2-dimensional theory of automata on series-parallel biposets. We define r...
In this paper I compare the expressive power of several models of concurrency based on their ability...
Abstract. We show how parallel composition of higher-dimensional au-tomata (HDA) can be expressed ca...
We show how parallel compostition of higher-dimensional automata (HDA) can be expressed categoricall...
International audienceOne of the popular notions of equivalence for non-interleaving concurrent syst...
We propose a generalization of higher-dimensional automata, partial HDA. Unlike HDA, and also extend...
International audienceWe propose a generalization of higher-dimensional automata, partial HDA. Unlik...
We introduce a new category of higher-dimensional automata in which the morphisms are functional hom...
Abstract. This paper contributes to the general understanding of the geometrical model of concurrenc...
It is shown that there exists a hereditary history-preserving bisimulation between a higher-dimensio...
AbstractWe show that history-preserving bisimilarity for higher-dimensional automata has a simple ch...
Higher-dimensional automata constitute a very expressive model for concurrent systems. In this pape...
This paper contributes to the general understanding of the geometrical model of concurrency that was...
AbstractAn abstract definition of bisimulation is presented. It makes possible a uniform definition ...
Parallel processes in concurrency theory can be modelled in a geometric framework. A convenient mode...
We provide the basics of a 2-dimensional theory of automata on series-parallel biposets. We define r...
In this paper I compare the expressive power of several models of concurrency based on their ability...