We provide an axiomatisation for =pTr , a variant of probabilistic trace equivalence as formulated by Bernardo et al., 2014, in the setting of the alternating model of Hansson. The equivalence considers traces individually instead of trace distributions. We show that our axiomatisation is sound and also complete for recursion-free sequential processes. Due to the nature of the trace equivalence, the axiomatisation is particularly complex
AbstractWe present a sound and complete axiomatization of finite complete trace semantics for genera...
AbstractWe address abstraction in the setting of probabilistic reactive systems, and study its forma...
Abstract. In the context of probabilistic verification, we provide a new notion of trace-equivalence...
We provide an axiomatisation for =pTr , a variant of probabilistic trace equivalence as formulated b...
[[abstract]]We study several notions of process equivalence—viz. trace, failure, ready, and bisimula...
We give a complete axiomatization of trace distribution precongruence for probabilistic nondetermini...
For nondeterministic and probabilistic processes, the validity of some desirable properties of proba...
International audienceWe show how finite and infinite trace semantics of generative probabilistic tr...
This paper studies trace-based equivalences for systems combiningnondeterministic and probabilistic ...
International audienceThis paper studies trace-based equivalences for systems combining nondetermini...
Two of the most studied extensions of trace and testing equivalences tonondeterministic and probabil...
Abstract. Two of the most studied extensions of trace and testing equivalences to non-deterministic ...
AbstractWe present a sound and complete axiomatization of finite complete trace semantics for genera...
AbstractWe address abstraction in the setting of probabilistic reactive systems, and study its forma...
Abstract. In the context of probabilistic verification, we provide a new notion of trace-equivalence...
We provide an axiomatisation for =pTr , a variant of probabilistic trace equivalence as formulated b...
[[abstract]]We study several notions of process equivalence—viz. trace, failure, ready, and bisimula...
We give a complete axiomatization of trace distribution precongruence for probabilistic nondetermini...
For nondeterministic and probabilistic processes, the validity of some desirable properties of proba...
International audienceWe show how finite and infinite trace semantics of generative probabilistic tr...
This paper studies trace-based equivalences for systems combiningnondeterministic and probabilistic ...
International audienceThis paper studies trace-based equivalences for systems combining nondetermini...
Two of the most studied extensions of trace and testing equivalences tonondeterministic and probabil...
Abstract. Two of the most studied extensions of trace and testing equivalences to non-deterministic ...
AbstractWe present a sound and complete axiomatization of finite complete trace semantics for genera...
AbstractWe address abstraction in the setting of probabilistic reactive systems, and study its forma...
Abstract. In the context of probabilistic verification, we provide a new notion of trace-equivalence...