We suggest an equivalence notion for event structures as a semantic model of concurrent systems. It combines the notion of testing (or failure) equivalence with respect to the timing of choices between dierent executions with a pre-cise account of causalities between action occurrences as in causal semantics. This lls an open gap in the lattice of equivalences considered in comparative concurrency semantics. We show that our notion coincides with a \canonical" equivalence obtained as the usual testing performed on causal trees. Further-more, we show that it is invariant under action renement, thus fullling a standard criterion for non-interleaving equivalences.
Fairness in a non-interleaving semantic model for concurrency has been investigated. In contrast to ...
International audienceWe propose a theoretical framework for testing concurrent systems from true co...
Concurrent systems identify systems, either software, hardware or even biological systems, that are ...
A flexible abstraction mechanism for models of concurrency, which allows systems which "look the sam...
AbstractCategory theory has been successfully employed to structure the confusing set-up of models a...
AbstractCategory theory has been successfully employed to structure the confusing setup of models an...
Category theory has been successfully employed to structure the confusing setup of models and equiva...
Event structures are one of the best known models for concurrency. Many variants of the basic model ...
Event structures are one of the best known models for concurrency. Many variants of the basic model ...
The intention of the paper is to establish a match between the equivalence induced by the partial or...
We study an operator for refinement of actions to be used in the design of concurrent systems. Actio...
International audienceWe propose a theoretical testing framework and a test generation algorithm for...
AbstractRefinement of actions allows one to design systems in a top-down style, changing the level o...
We propose a logic for true concurrency whose formulae predicate about events in computations and th...
A methodology is introduced for defining truly concurrent semantics of processes as equivalence clas...
Fairness in a non-interleaving semantic model for concurrency has been investigated. In contrast to ...
International audienceWe propose a theoretical framework for testing concurrent systems from true co...
Concurrent systems identify systems, either software, hardware or even biological systems, that are ...
A flexible abstraction mechanism for models of concurrency, which allows systems which "look the sam...
AbstractCategory theory has been successfully employed to structure the confusing set-up of models a...
AbstractCategory theory has been successfully employed to structure the confusing setup of models an...
Category theory has been successfully employed to structure the confusing setup of models and equiva...
Event structures are one of the best known models for concurrency. Many variants of the basic model ...
Event structures are one of the best known models for concurrency. Many variants of the basic model ...
The intention of the paper is to establish a match between the equivalence induced by the partial or...
We study an operator for refinement of actions to be used in the design of concurrent systems. Actio...
International audienceWe propose a theoretical testing framework and a test generation algorithm for...
AbstractRefinement of actions allows one to design systems in a top-down style, changing the level o...
We propose a logic for true concurrency whose formulae predicate about events in computations and th...
A methodology is introduced for defining truly concurrent semantics of processes as equivalence clas...
Fairness in a non-interleaving semantic model for concurrency has been investigated. In contrast to ...
International audienceWe propose a theoretical framework for testing concurrent systems from true co...
Concurrent systems identify systems, either software, hardware or even biological systems, that are ...