Add to ORKGThis paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finite-state agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571-595). The axiomatization is obtained by extending the general axioms of iteration theories (or iteration algebras), which characterize the equational properties of the fixed point operator on (omega-)continuous or monotonic functions, with three axiom schemas that express laws that are specific to probabilistic bisimilarity. Hence probabilistic bisimilarity (over finite-state agents) has an equational axiomatization relative to iteration algebras
International audienceWe study a process calculus which combines both nondeterministic and probabili...
This paper presents an equational axiomatization of bisimulation equivalence over the language of Ba...
Probabilistic automata were introduced by Rabin in 1963 as language acceptors. Two automata are equi...
We study a process algebra which combines both nondeterministic and probabilistic behavior in the st...
Abstract. We study complete axiomatizations for dierent notions of probabilistic bisimulation on a r...
\u3cp\u3eThis paper proposes a notion of branching bisimilarity for non-deterministic probabilistic ...
In this paper we propose a complete axiomatization of the bisimilarity distance of Desharnais et al....
AbstractThis paper is concerned with finding complete axiomatizations of probabilistic processes. We...
This paper proposes a notion of branching bisimilarity for non-deterministic probabilistic processes...
In this paper we propose a complete axiomatization of the bisimilarity distance of Desharnais et al....
This paper proposes a notion of branching bisimilarity for non-deterministic probabilistic processes...
[[abstract]]We study several notions of process equivalence—viz. trace, failure, ready, and bisimula...
AbstractWe introduce a new notion of bisimulation, called event bisimulation on labelled Markov proc...
AbstractIn this paper we introduce a new class of labelled transition systems—labelled Markov proces...
We study equational axiomatizations of bisimulation equivalence for the language obtained by extendi...
International audienceWe study a process calculus which combines both nondeterministic and probabili...
This paper presents an equational axiomatization of bisimulation equivalence over the language of Ba...
Probabilistic automata were introduced by Rabin in 1963 as language acceptors. Two automata are equi...
We study a process algebra which combines both nondeterministic and probabilistic behavior in the st...
Abstract. We study complete axiomatizations for dierent notions of probabilistic bisimulation on a r...
\u3cp\u3eThis paper proposes a notion of branching bisimilarity for non-deterministic probabilistic ...
In this paper we propose a complete axiomatization of the bisimilarity distance of Desharnais et al....
AbstractThis paper is concerned with finding complete axiomatizations of probabilistic processes. We...
This paper proposes a notion of branching bisimilarity for non-deterministic probabilistic processes...
In this paper we propose a complete axiomatization of the bisimilarity distance of Desharnais et al....
This paper proposes a notion of branching bisimilarity for non-deterministic probabilistic processes...
[[abstract]]We study several notions of process equivalence—viz. trace, failure, ready, and bisimula...
AbstractWe introduce a new notion of bisimulation, called event bisimulation on labelled Markov proc...
AbstractIn this paper we introduce a new class of labelled transition systems—labelled Markov proces...
We study equational axiomatizations of bisimulation equivalence for the language obtained by extendi...
International audienceWe study a process calculus which combines both nondeterministic and probabili...
This paper presents an equational axiomatization of bisimulation equivalence over the language of Ba...
Probabilistic automata were introduced by Rabin in 1963 as language acceptors. Two automata are equi...