AbstractThe phenomenon of concurrency is modelled by commutativity. We define for any nonempty word over the action alphabet its concurrency degree, a real number which measures the rate of simultaneousness, when the sequence of actions represented by the word is performed. We study this degree and we show, in particular, that when a word of length n is chosen at random, increases the degree tends with probability 1 to a fixed limit which is completely determined by the commutation system
International audienceThe topic of this paper is the distributed and incremental generation of long ...
AbstractThe overall intention of this work is to investigate the ability to regard a finite computat...
Fairness in a non-interleaving semantic model for concurrency has been investigated. In contrast to ...
AbstractAutomata with concurrency relations A are labelled transition systems with a collection of b...
79 pagesParallelism and concurrency are fundamental concepts in computer science. Specif...
AbstractAutomata with concurrency relations A are labelled transition systems with a collection of b...
AbstractAn automaton with concurrency relations A is a labelled transition system with a collection ...
Concurrency has an important role in modern systems and programming. It reveals the phenomenon that ...
The first part of the paper is an introduction to the theory of probabilistic concurrent systems und...
A concurrent program is a composition of several logical blocks: the processes. Each process has its...
AbstractNumerous models of concurrency have been considered in the framework of automata. Among the ...
AbstractThe free partially commutative monoid M(A,Θ) defined by a set of commutation relations Θ on ...
International audienceIn this paper, we study the shuffle operator on concurrent processes (represen...
In this paper we address the problem of understanding Concurrency Theory from a combinatorial point ...
Un programme concurrent est composé de plusieurs unités logiques : les processus. Chaque processus a...
International audienceThe topic of this paper is the distributed and incremental generation of long ...
AbstractThe overall intention of this work is to investigate the ability to regard a finite computat...
Fairness in a non-interleaving semantic model for concurrency has been investigated. In contrast to ...
AbstractAutomata with concurrency relations A are labelled transition systems with a collection of b...
79 pagesParallelism and concurrency are fundamental concepts in computer science. Specif...
AbstractAutomata with concurrency relations A are labelled transition systems with a collection of b...
AbstractAn automaton with concurrency relations A is a labelled transition system with a collection ...
Concurrency has an important role in modern systems and programming. It reveals the phenomenon that ...
The first part of the paper is an introduction to the theory of probabilistic concurrent systems und...
A concurrent program is a composition of several logical blocks: the processes. Each process has its...
AbstractNumerous models of concurrency have been considered in the framework of automata. Among the ...
AbstractThe free partially commutative monoid M(A,Θ) defined by a set of commutation relations Θ on ...
International audienceIn this paper, we study the shuffle operator on concurrent processes (represen...
In this paper we address the problem of understanding Concurrency Theory from a combinatorial point ...
Un programme concurrent est composé de plusieurs unités logiques : les processus. Chaque processus a...
International audienceThe topic of this paper is the distributed and incremental generation of long ...
AbstractThe overall intention of this work is to investigate the ability to regard a finite computat...
Fairness in a non-interleaving semantic model for concurrency has been investigated. In contrast to ...