Geometrical concurrency was introduced by V. Pratt and R. van Glabbeek as the model of Higher Dimensional Automata (HDA) [Pra03, Pra00, vG06]. ◮ HDA is more general than most other true concurrency models (like event structures or Petri nets), and accommodates nicely action refinement [vGG01]. ◮ HDAs are not constrained to only before-after modelling and expose explicitly the choices in the system, therefore combining well causality, concurrency, and choice. Modal logic over HDAs was introduced as HDML [Pri10]. ◮ HDML contrasts with standard modal logics in the fact that it can reason about what holds “during ” some concurrent events are executing. ◮ HDML captures only split bisimulation, which is rather low in the spectrum of van Glabbeek ...
It is shown that there exists a hereditary history-preserving bisimulation between a higher-dimensio...
International audienceWe propose a generalization of higher-dimensional automata, partial HDA. Unlik...
AbstractWe show that history-preserving bisimilarity for higher-dimensional automata has a simple ch...
This paper contributes to the general understanding of the geometrical model of concurrency that was...
Abstract. This paper contributes to the general understanding of the geometrical model of concurrenc...
Higher dimensional automata (HDA) are a model of concurrency [5, 8] that can express most of the tra...
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditiona...
In this paper I compare the expressive power of several models of concurrency based on their ability...
AbstractIn this paper I compare the expressive power of several models of concurrency based on their...
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditiona...
In this paper I compare the expressive power of several models of concurrency based on their ability...
AbstractIn this paper I compare the expressive power of several models of concurrency based on their...
Abstract. Higher dimensional automata (HDA) are a model of concur-rency that can express most of the...
We propose a generalization of higher-dimensional automata, partial HDA. Unlike HDA, and also extend...
International audienceOne of the popular notions of equivalence for non-interleaving concurrent syst...
It is shown that there exists a hereditary history-preserving bisimulation between a higher-dimensio...
International audienceWe propose a generalization of higher-dimensional automata, partial HDA. Unlik...
AbstractWe show that history-preserving bisimilarity for higher-dimensional automata has a simple ch...
This paper contributes to the general understanding of the geometrical model of concurrency that was...
Abstract. This paper contributes to the general understanding of the geometrical model of concurrenc...
Higher dimensional automata (HDA) are a model of concurrency [5, 8] that can express most of the tra...
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditiona...
In this paper I compare the expressive power of several models of concurrency based on their ability...
AbstractIn this paper I compare the expressive power of several models of concurrency based on their...
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditiona...
In this paper I compare the expressive power of several models of concurrency based on their ability...
AbstractIn this paper I compare the expressive power of several models of concurrency based on their...
Abstract. Higher dimensional automata (HDA) are a model of concur-rency that can express most of the...
We propose a generalization of higher-dimensional automata, partial HDA. Unlike HDA, and also extend...
International audienceOne of the popular notions of equivalence for non-interleaving concurrent syst...
It is shown that there exists a hereditary history-preserving bisimulation between a higher-dimensio...
International audienceWe propose a generalization of higher-dimensional automata, partial HDA. Unlik...
AbstractWe show that history-preserving bisimilarity for higher-dimensional automata has a simple ch...