English
Related papers

Related papers: Modal Characterisations of Behavioural Pseudometri…

200 papers

Bisimulation metrics provide a robust and accurate approach to study the behavior of nondeterministic probabilistic processes. In this paper, we propose a logical characterization of bisimulation metrics based on a simple probabilistic…

Logic in Computer Science · Computer Science 2016-10-27 Valentina Castiglioni , Daniel Gebler , Simone Tini

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

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

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

We define a general notion of transition system where states and action labels can be from arbitrary nominal sets, actions may bind names, and state predicates from an arbitrary logic define properties of states. A Hennessy-Milner logic for…

Logic in Computer Science · Computer Science 2023-06-22 Joachim Parrow , Johannes Borgström , Lars-Henrik Eriksson , Ramūnas Forsberg Gutkovas , Tjark Weber

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

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

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

Labelled transitions systems can be studied in terms of modal logic and in terms of bisimulation. These two notions are connected by Hennessy-Milner theorems, that show that two states are bisimilar precisely when they satisfy the same…

Logic in Computer Science · Computer Science 2025-11-05 Herman Geuvers , Komi Golov

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

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 metrics provide a quantitative refinement of classical two-valued behavioural equivalences on systems with quantitative data, such as metric or probabilistic transition systems. In analogy to the linear-time/branching-time…

Logic in Computer Science · Computer Science 2025-01-28 Jonas Forster , Lutz Schröder , Paul Wild , Harsh Beohar , Sebastian Gurke , Barbara König , Karla Messing

The classical Hennessy-Milner theorem is an important tool in the analysis of concurrent processes; it guarantees that any two non-bisimilar states in finitely branching labelled transition systems can be distinguished by a modal formula.…

Logic in Computer Science · Computer Science 2022-08-31 Jonas Forster , Sergey Goncharov , Dirk Hofmann , Pedro Nora , Lutz Schröder , Paul Wild

There are two fundamentally different approaches to specifying and verifying properties of systems. The logical approach makes use of specifications given as formulae of temporal or modal logics and relies on efficient model checking…

Logic in Computer Science · Computer Science 2013-06-05 Nikola Beneš , Benoît Delahaye , Uli Fahrenberg , Jan Křetínský , Axel Legay

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

The classical Hennessy-Milner theorem says that two states of an image-finite transition system are bisimilar if and only if they satisfy the same formulas in a certain modal logic. In this paper we study this type of result in a general…

Logic in Computer Science · Computer Science 2023-06-22 Clemens Kupke , Jurriaan Rot

Classical logics of knowledge and belief are usually interpreted on Kripke models, for which a mathematically well-developed model theory is available. However, such models are inadequate to capture dynamic phenomena. Therefore, epistemic…

Logic in Computer Science · Computer Science 2015-03-13 Lorenz Demey

In this paper, we introduce the simulations and bisimulations on polarity-based semantics for non-distributive modal logic, which are natural generalizations of those notions on Kripke semantics for modal logic. We also generalize other…

Logic · Mathematics 2024-04-09 Yiwen Ding , Krishna Manoorkar , Mattia Panettiere , Ruoding Wang

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

We study the mathematical properties of bilateral state-based modal logic (BSML), a modal logic employing state-based semantics (also known as team semantics), which has been used to account for free choice inferences and related linguistic…

Logic · Mathematics 2025-01-13 Maria Aloni , Aleksi Anttila , Fan Yang
‹ Prev 1 2 3 10 Next ›