Raiders of the lost equivalence: probabilistic branching bisimilarity
type: Item
instance of: scholarly article
title: Raiders of the lost equivalence: probabilistic branching bisimilarity
zbMATH Open document ID: 1441.68145
author: Valentina Castiglioni
author: Simone Tini
published in: Information Processing Letters
publication date: 2020-08-04T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q87
zbMATH DE Number: 7227686
zbMATH Keywords: formal semantics
zbMATH Keywords: nondeterministic probabilistic processes
zbMATH Keywords: probabilistic branching bisimilarity
zbMATH Keywords: semi-branching bisimilarity
zbMATH Keywords: equivalence relations
MaRDI profile type: Publication
full work available at URL: j.ipl.2020.105947
OpenAlex ID: W3013492721
cites work: Branching bisimulation congruence for probabilistic systems
cites work: Branching bisimulation for probabilistic systems: characteristics and decidability
cites work: Branching bisimilarity is an equivalence indeed!
cites work: Branching time and orthogonal bisimulation equivalence
cites work: A Specification Format for Rooted Branching Bisimulation
cites work: Probabilistic divide \& congruence: branching bisimilarity
cites work: Three logics for branching bisimulation
cites work: Characterising Probabilistic Processes Logically
cites work: Characterising Testing Preorders for Finite Probabilistic Processes
cites work: Rooted branching bisimulation as a congruence
cites work: Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity
cites work: Reactive, generative, and stratified models of probabilistic processes
cites work: Branching time and abstraction in bisimulation semantics
cites work: An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation
cites work: Q4038723
cites work: A logic for reasoning about time and reliability
cites work: Exploring probabilistic bisimulations. I
cites work: A process algebra for timed systems
cites work: Formal verification of parallel programs
cites work: Q3519383
cites work: A calculus of communicating systems
cites work: Q3907077
cites work: Q4536612
cites work: Confluence reduction for Markov automata
cites work: Polynomial time decision algorithms for probabilistic automata
DOI: 10.1016/J.IPL.2020.105947
description: scientific article; zbMATH DE number 7227686