Characterising Probabilistic Processes Logically

DOI10.1007/978-3-642-16242-8_20zbMath1306.68122arXiv1007.5188OpenAlexW2999787423MaRDI QIDQ4933311

Yu-xin Deng, Robert J. van Glabbeek

Publication date: 12 October 2010

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.5188

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (11)

A General Framework for Probabilistic Characterizing Formulae ⋮ Probabilistic bisimilarity as testing equivalence ⋮ Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions ⋮ Explainability of probabilistic bisimilarity distances for labelled Markov chains ⋮ Exploring probabilistic bisimulations. I ⋮ Unnamed Item ⋮ Probabilistic divide \& congruence: branching bisimilarity ⋮ Logical characterization of branching metrics for nondeterministic probabilistic transition systems ⋮ Unnamed Item ⋮ A Spectrum of Behavioral Relations over LTSs on Probability Distributions ⋮ Raiders of the lost equivalence: probabilistic branching bisimilarity

This page was built for publication: Characterising Probabilistic Processes Logically