Probabilistic divide \& congruence: branching bisimilarity
type: Item
instance of: scholarly article
title: Probabilistic divide \& congruence: branching bisimilarity
zbMATH Open document ID: 1436.68209
author: Valentina Castiglioni
author: Simone Tini
published in: Theoretical Computer Science
publication date: 2019-11-22T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 7135129
zbMATH Keywords: modal decomposition
zbMATH Keywords: nondeterministic probabilistic transition systems
zbMATH Keywords: SOS
zbMATH Keywords: congruence formats
zbMATH Keywords: probabilistic branching bisimulation
MaRDI profile type: Publication
full work available at URL: j.tcs.2019.09.037
OpenAlex ID: W2975938706
cites work: Structural operational semantics.
cites work: Q2767184
cites work: Branching bisimulation congruence for probabilistic systems
cites work: Process Algebra
cites work: Branching bisimilarity is an equivalence indeed!
cites work: Structural operational semantics for weak bisimulations
cites work: Precongruence formats for decorated trace semantics
cites work: Bisimulation can't be traced
cites work: Modal Decomposition on Nondeterministic Probabilistic Processes
cites work: Q4580323
cites work: Logical characterization of branching metrics for nondeterministic probabilistic transition systems
cites work: Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules
cites work: A general SOS theory for the specification of probabilistic transition systems
cites work: Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation
cites work: Three logics for branching bisimulation
cites work: Semantics of Probabilistic Processes
cites work: Probabilistic barbed congruence
cites work: Characterising Probabilistic Processes Logically
cites work: Characterising Testing Preorders for Finite Probabilistic Processes
cites work: Remarks on testing probabilistic processes
cites work: Metrics for labelled Markov processes
cites work: Q4484498
cites work: Rooted branching bisimulation as a congruence
cites work: Divide and Congruence II
cites work: Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
cites work: Q5111193
cites work: Divide and congruence III: Stability & divergence
cites work: Compositionality of Hennessy-Milner logic by structural operational semantics
cites work: Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity
cites work: Probabilistic NetKAT
cites work: Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics
cites work: Compositional bisimulation metric reasoning with Probabilistic Process Calculi
cites work: Q4992498
cites work: Q4995155
cites work: SOS specifications of probabilistic systems by uniformly continuous operators
cites work: SOS specifications for uniformly continuous operators
cites work: Q4818861
cites work: On cool congruence formats for weak bisimulations
cites work: Reactive, generative, and stratified models of probabilistic processes
cites work: Transition system specifications with negative premises
cites work: Quantifying leakage in the presence of unreliable sources of information
cites work: A logic for reasoning about time and reliability
cites work: Algebraic laws for nondeterminism and concurrency
cites work: Probabilistic extensions of process algebras.
cites work: Formal verification of parallel programs
cites work: Compositional weak metrics for group key update
cites work: Probabilistic bisimulation as a congruence
cites work: Bisimulation through probabilistic testing
cites work: Compositionality Through an Operational Semantics of Contexts
cites work: Logical characterization of bisimulation for transition relations over probability distributions with internal actions
cites work: Q3519383
cites work: A Proof System for Compositional Verification of Probabilistic Concurrent Processes
cites work: SOS formats and meta-theory: 20 years after
cites work: Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
cites work: Q4536612
cites work: Q4743724
cites work: Formal verification of timed properties of randomized distributed algorithms
cites work: Higher-level synchronising devices in Meije-SCCS
cites work: Q4791270
DOI: 10.1016/J.TCS.2019.09.037
description: scientific article; zbMATH DE number 7135129