AbstractWe extend our previous duality theorem for Markov processes by equipping the processes with a pseudometric and the algebras with a notion of metric diameter. We are able to show that the isomorphisms of our previous duality theorem become isometries in this quantitative setting. This opens the way to developing theories of approximate reasoning for probabilistic systems
International audienceWe transfer a notion of quantitative bisimilarity for labelled Markov processe...
AbstractThe notion of process equivalence of probabilistic processes is sensitive to the exact proba...
We recast the theory of labelled Markov processes in a new setting, in a way "dual" to the usual ...
We extend our previous duality theorem for Markov processes by equipping the processes with a pseudo...
We extend our previous duality theorem for Markov processes by equipping the processes with a pseudo...
We extend our previous duality theorem for Markov processes by equipping the processes with a pseudo...
Stone duality relates logic, in the form of Boolean algebra, to spaces. Stone-type dualities abound ...
We define Aumann algebras, an algebraic analog of probabilistic modal logic. An Aumann algebra cons...
A central questions in the field of probabilistic and Markovian systems is “when do two systems beha...
In this paper we propose a complete axiomatization of the bisimilarity distance of Desharnais et al....
AbstractThis article provides a survey of approximation metrics for stochastic processes. We deal wi...
Markov processes are a fundamental model of probabilistic transition systems and are the underlying ...
AbstractIn this paper, we consider the behavioral pseudometrics for probabilistic systems, which are...
AbstractThis paper establishes a Stone-type duality between specifications and infLMPs. An infLMP is...
AbstractIn this paper we introduce a new class of labelled transition systems—labelled Markov proces...
International audienceWe transfer a notion of quantitative bisimilarity for labelled Markov processe...
AbstractThe notion of process equivalence of probabilistic processes is sensitive to the exact proba...
We recast the theory of labelled Markov processes in a new setting, in a way "dual" to the usual ...
We extend our previous duality theorem for Markov processes by equipping the processes with a pseudo...
We extend our previous duality theorem for Markov processes by equipping the processes with a pseudo...
We extend our previous duality theorem for Markov processes by equipping the processes with a pseudo...
Stone duality relates logic, in the form of Boolean algebra, to spaces. Stone-type dualities abound ...
We define Aumann algebras, an algebraic analog of probabilistic modal logic. An Aumann algebra cons...
A central questions in the field of probabilistic and Markovian systems is “when do two systems beha...
In this paper we propose a complete axiomatization of the bisimilarity distance of Desharnais et al....
AbstractThis article provides a survey of approximation metrics for stochastic processes. We deal wi...
Markov processes are a fundamental model of probabilistic transition systems and are the underlying ...
AbstractIn this paper, we consider the behavioral pseudometrics for probabilistic systems, which are...
AbstractThis paper establishes a Stone-type duality between specifications and infLMPs. An infLMP is...
AbstractIn this paper we introduce a new class of labelled transition systems—labelled Markov proces...
International audienceWe transfer a notion of quantitative bisimilarity for labelled Markov processe...
AbstractThe notion of process equivalence of probabilistic processes is sensitive to the exact proba...
We recast the theory of labelled Markov processes in a new setting, in a way "dual" to the usual ...