Higher dimensional automata (HDA) are a model of concurrency [5, 8] that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or Petri nets. Modal logics, interpreted over Kripke structures, are the logics for reasoning about sequential behavior and interleaved concurrency. Modal logic is a well behaved subset of first-order logic; many vari-ants of modal logic are decidable. However, there are no modal-like logics for the more expressive HDA models. We introduce and develop a modal logic over HDAs which incorporates two modalities for reasoning about “during ” and “af-ter”. This general higher dimensional modal logic (HDML) is shown to be de-cidable and we provide a complete axiomati...
AbstractIn this paper we present a new kind of semantics for Concurrent ML, apopular concurrent exte...
Modal logics, originally conceived in philosophy, have recently found many applications in computer ...
In a recent article, Lauri Hella and co-authors identify a canonical connection between modal logic ...
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditiona...
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditiona...
Abstract. Higher dimensional automata (HDA) are a model of concur-rency that can express most of the...
Abstract. This paper contributes to the general understanding of the geometrical model of concurrenc...
Geometrical concurrency was introduced by V. Pratt and R. van Glabbeek as the model of Higher Dimens...
AbstractIn this paper I compare the expressive power of several models of concurrency based on their...
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...
In this paper I compare the expressive power of several models of concurrency based on their ability...
The higher-dimensional modal µ-calculus is an extension of the µ-calculus in which formulas are inte...
International audienceWe propose a generalization of higher-dimensional automata, partial HDA. Unlik...
We propose a generalization of higher-dimensional automata, partial HDA. Unlike HDA, and also extend...
AbstractIn this paper we present a new kind of semantics for Concurrent ML, apopular concurrent exte...
Modal logics, originally conceived in philosophy, have recently found many applications in computer ...
In a recent article, Lauri Hella and co-authors identify a canonical connection between modal logic ...
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditiona...
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditiona...
Abstract. Higher dimensional automata (HDA) are a model of concur-rency that can express most of the...
Abstract. This paper contributes to the general understanding of the geometrical model of concurrenc...
Geometrical concurrency was introduced by V. Pratt and R. van Glabbeek as the model of Higher Dimens...
AbstractIn this paper I compare the expressive power of several models of concurrency based on their...
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...
In this paper I compare the expressive power of several models of concurrency based on their ability...
The higher-dimensional modal µ-calculus is an extension of the µ-calculus in which formulas are inte...
International audienceWe propose a generalization of higher-dimensional automata, partial HDA. Unlik...
We propose a generalization of higher-dimensional automata, partial HDA. Unlike HDA, and also extend...
AbstractIn this paper we present a new kind of semantics for Concurrent ML, apopular concurrent exte...
Modal logics, originally conceived in philosophy, have recently found many applications in computer ...
In a recent article, Lauri Hella and co-authors identify a canonical connection between modal logic ...