English
Related papers

Related papers: Logical Characterization of Bisimulation Metrics

200 papers

For the model of probabilistic labelled transition systems that allow for the co-existence of nondeterminism and probabilities, we present two notions of bisimulation metrics: one is state-based and the other is distribution-based. We…

Logic in Computer Science · Computer Science 2015-09-14 Yuxin Deng , Wenjie Du , Daniel Gebler

We develop a pseudo-metric analogue of bisimulation for generalized semi-Markov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisimulation for continuous-time probabilistic processes to a…

Logic in Computer Science · Computer Science 2017-01-11 Vineet Gupta , Radha Jagadeesan , Prakash Panangaden

Many behavioural equivalences or preorders for probabilistic processes involve a lifting operation that turns a relation on states into a relation on distributions of states. We show that several existing proposals for lifting relations can…

Logic in Computer Science · Computer Science 2011-03-24 Yuxin Deng , Wenjie Du

We present new algorithms for computing and approximating bisimulation metrics in Markov Decision Processes (MDPs). Bisimulation metrics are an elegant formalism that capture behavioral equivalence between states and provide strong…

Machine Learning · Computer Science 2019-11-22 Pablo Samuel Castro

In probabilistic transition systems, behavioural metrics provide a more fine-grained and stable measure of system equivalence than crisp notions of bisimilarity. They correlate strongly to quantitative probabilistic logics, and in fact the…

Logic in Computer Science · Computer Science 2019-06-05 Paul Wild , Lutz Schröder , Dirk Pattinson , Barbara König

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 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

A Markov decision process (MDP) is a state-based dynamical system capable of describing probabilistic behaviour with rewards. In this paper, we view MDPs as coalgebras living in the category of analytic spaces, a very general class of…

Logic in Computer Science · Computer Science 2025-05-30 Daniel Luckhardt , Harsh Beohar , Clemens Kupke

Bisimulation is a concept that captures behavioural equivalence of states in a variety of types of transition systems. It has been widely studied in discrete-time settings where a key notion is the bisimulation metric which quantifies "how…

Logic in Computer Science · Computer Science 2025-11-27 Linan Chen , Florence Clerc , Prakash Panangaden

Bisimulation is a concept that captures behavioural equivalence of states in a variety of types of transition systems. It has been widely studied in a discrete-time setting where the notion of a step is fundamental. In our setting we are…

Logic in Computer Science · Computer Science 2024-05-01 Linan Chen , Florence Clerc , Prakash Panangaden

Behavioural equivalences can be characterized via bisimulations, modal logics and spoiler-defender games. In this paper we review these three perspectives in a coalgebraic setting, which allows us to generalize from the particular branching…

Logic in Computer Science · Computer Science 2021-04-20 Barbara König , Christina Mika-Michalski

Learning generalizeable policies from visual input in the presence of visual distractions is a challenging problem in reinforcement learning. Recently, there has been renewed interest in bisimulation metrics as a tool to address this issue;…

Machine Learning · Computer Science 2022-01-31 Martin Bertran , Walter Talbott , Nitish Srivastava , Joshua Susskind

In this work, we generalize the concept of bisimulation metric in order to metrize the behaviour of continuous-time processes. Similarly to what is done for discrete-time systems, we follow two approaches and show that they coincide: as a…

Logic in Computer Science · Computer Science 2025-01-23 Linan Chen , Florence Clerc , Prakash Panangaden

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

Bisimulation metric is a robust behavioural semantics for probabilistic processes. Given any SOS specification of probabilistic processes, we provide a method to compute for each operator of the language its respective metric…

Programming Languages · Computer Science 2014-08-08 Daniel Gebler , Simone Tini

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

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

We define a new logic-induced notion of bisimulation (called $\rho$-bisimulation) for coalgebraic modal logics given by a logical connection, and investigate its properties. We show that it is structural in the sense that it is defined only…

Logic in Computer Science · Computer Science 2020-08-24 Jim de Groot , Helle Hvid Hansen , Alexander Kurz

Bisimulation metrics define a distance measure between states of a Markov decision process (MDP) based on a comparison of reward sequences. Due to this property they provide theoretical guarantees in value function approximation (VFA). In…

Machine Learning · Computer Science 2022-11-15 Mete Kemertas , Allan Jepson

Behavioural distances generally offer more fine-grained means of comparing quantitative systems than two-valued behavioural equivalences. They often relate to quantitative modalities, which generate quantitative modal logics that…

Logic in Computer Science · Computer Science 2026-02-13 Jonas Forster , Lutz Schröder , Paul Wild , Barbara König , Pedro Nora
‹ Prev 1 2 3 10 Next ›