English
Related papers

Related papers: A classification of bisimilarities for general Mar…

200 papers

We extend the theory of labeled Markov processes with internal nondeterminism, a fundamental concept for the further development of a process theory with abstraction on nondeterministic continuous probabilistic systems. We define…

Logic in Computer Science · Computer Science 2015-03-17 Pedro D'Argenio , Pedro Sánchez Terraf , Nicolás Wolovick

We quickly review labelled Markov processes (LMP) and provide a counterexample showing that in general measurable spaces, event bisimilarity and state bisimilarity differ in LMP. This shows that the logic in Desharnais [*] does not…

Logic in Computer Science · Computer Science 2010-12-13 Pedro Sánchez Terraf

In this paper we propose a (sub)distribution-based bisimulation for labelled Markov processes and compare it with earlier definitions of state and event bisimulation, which both only compare states. In contrast to those state-based…

Logic in Computer Science · Computer Science 2017-07-03 Pengfei Yang , David N. Jansen , Lijun Zhang

We study the nature of applicative bisimilarity in $\lambda$-calculi endowed with operators for sampling from continuous distributions. On the one hand, we show that bisimilarity, logical equivalence, and testing equivalence all coincide…

Logic in Computer Science · Computer Science 2022-07-22 Gilles Barthe , Raphaëlle Crubillé , Ugo Dal Lago , Francesco Gavazzo

We assess the descriptive complexity of *bisimilarity* or "equality of behavior" on a family of Markov decision processes over uncountable standard Borel spaces, namely *nondeterministic labelled Markov processes* (NLMP). We show that…

Logic in Computer Science · Computer Science 2026-04-09 Martín Santiago Moroni , Pedro Sánchez Terraf

A labelled Markov decision process is a labelled Markov chain with nondeterminism, i.e., together with a strategy a labelled MDP induces a labelled Markov chain. The model is related to interval Markov chains. Motivated by applications of…

Formal Languages and Automata Theory · Computer Science 2020-09-25 Stefan Kiefer , Qiyi Tang

There exist two notions of equivalence of behavior between states of a Labelled Markov Process (LMP): state bisimilarity and event bisimilarity. The first one can be considered as an appropriate generalization to continuous spaces of Larsen…

Logic in Computer Science · Computer Science 2022-12-26 Martín Santiago Moroni , Pedro Sánchez Terraf

We present metrics for measuring the similarity of states in a finite Markov decision process (MDP). The formulation of our metrics is based on the notion of bisimulation for MDPs, with an aim towards solving discounted infinite horizon…

Artificial Intelligence · Computer Science 2012-07-19 Norman Ferns , Prakash Panangaden , Doina Precup

The bisimulation metric (BSM) is a powerful tool for analyzing state similarities within a Markov decision process (MDP), revealing that states closer in BSM have more similar optimal value functions. While BSM has been successfully…

Machine Learning · Computer Science 2025-12-22 Zhenyu Tao , Wei Xu , Xiaohu You

This paper studies various notions of approximate probabilistic bisimulation on labeled Markov chains (LMCs). We introduce approximate versions of weak and branching bisimulation, as well as a notion of $\varepsilon$-perturbed bisimulation…

Logic in Computer Science · Computer Science 2024-07-11 Timm Spork , Christel Baier , Joost-Pieter Katoen , Jakob Piribauer , Tim Quatmann

We introduce a generalization of the bisimulation game that finds distinguishing Hennessy-Milner logic formulas from every finitary, subformula-closed language in van Glabbeek's linear-time--branching-time spectrum between two finite-state…

Computer Science and Game Theory · Computer Science 2023-06-22 Benjamin Bisping , David N. Jansen , Uwe Nestmann

The bisimulation metric (BSM) is a powerful tool for computing state similarities within a Markov decision process (MDP), revealing that states closer in BSM have more similar optimal value functions. While BSM has been successfully…

Machine Learning · Computer Science 2025-11-04 Zhenyu Tao , Wei Xu , Xiaohu You

We study bisimulation and context equivalence in a probabilistic $\lambda$-calculus. The contributions of this paper are threefold. Firstly we show a technique for proving congruence of probabilistic applicative bisimilarity. While the…

Programming Languages · Computer Science 2013-11-08 Ugo Dal Lago , Davide Sangiorgi , Michele Alberti

In this work we introduce new approximate similarity relations that are shown to be key for policy (or control) synthesis over general Markov decision processes. The models of interest are discrete-time Markov decision processes, endowed…

Systems and Control · Computer Science 2016-06-01 S. Haesaert , S. Esmaeil Zadeh Soudjani , A. Abate

In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the modal mu-calculus and show how to derive characteristic formulae for…

Logic in Computer Science · Computer Science 2015-05-19 Yuxin Deng , Rob van Glabbeek

We study coupled logical bisimulation (CLB) to reason about contextual equivalence in the lambda-calculus. CLB originates in a work by Dal Lago, Sangiorgi and Alberti, as a tool to reason about a lambda-calculus with probabilistic…

Logic in Computer Science · Computer Science 2014-10-13 Ryan Kavanagh , Jean-Marie Madiot

A new object of the probability theory, two-sided chain of events (symbols), is introduced. A theory of multi-steps Markov chains with long-range memory, proposed earlier in Phys. Rev. E 68, 06117 (2003), is developed and used to establish…

Data Analysis, Statistics and Probability · Physics 2007-05-23 S. S. Apostolov , Z. A. Mayzelis , O. V. Usatenko , V. A. Yampol'skii

We consider first the mixed discrete-continuous scheme of observation in multistate models; this is a classical pattern in epidemiology because very often clinical status is assessed at discrete visit times while times of death or other…

Statistics Theory · Mathematics 2008-12-18 Daniel Commenges , Anne Gégout-Petit

We introduce polynomial couplings, a generalization of probabilistic couplings, to develop an algorithm for the computation of equivalence relations which can be interpreted as a lifting of probabilistic bisimulation to polynomial…

Logic in Computer Science · Computer Science 2021-04-28 Giorgio Bacci , Giovanni Bacci , Kim G. Larsen , Mirco Tribastone , Max Tschaikowski , Andrea Vandin

Bisimilarity as an equivalence notion of systems has been central to process theory. Due to the recent rise of interest in quantitative systems (probabilistic, weighted, hybrid, etc.), bisimilarity has been extended in various ways:…

Logic in Computer Science · Computer Science 2019-07-24 Yuichi Komorida , Shin-ya Katsumata , Nick Hu , Bartek Klin , Ichiro Hasuo
‹ Prev 1 2 3 10 Next ›