Branching bisimulation congruence for probabilistic systems
type: Item
instance of: scholarly article
title: Branching bisimulation congruence for probabilistic systems
zbMATH Open document ID: 1234.68282
author: S. Andova
author: Sonja Georgievska
author: Nikola Trčka
published in: Theoretical Computer Science
publication date: 2012-03-13T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q87
zbMATH DE Number: 6014288
zbMATH Keywords: branching bisimulation
zbMATH Keywords: probabilistic
zbMATH Keywords: nondeterministic systems
zbMATH Keywords: parallel composition
zbMATH Keywords: PCTL
zbMATH Keywords: process algebra
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.07.020
OpenAlex ID: W2020876738
cites work: Branching time and abstraction in bisimulation semantics
cites work: Q4038723
cites work: Three logics for branching bisimulation
cites work: Validation of Stochastic Systems
cites work: Q4536612
cites work: Branching bisimulation for probabilistic systems: characteristics and decidability
cites work: A calculus of communicating systems
cites work: Branching time and orthogonal bisimulation equivalence
cites work: Q3519383
cites work: Q2769588
cites work: Bisimulation through probabilistic testing
cites work: Model checking of probabilistic and nondeterministic systems
cites work: Q5137353
cites work: Q3404131
cites work: Branching Bisimulation Congruence for Probabilistic Systems
cites work: CONCUR 2005 – Concurrency Theory
cites work: Processes, Terms and Cycles: Steps on the Road to Infinity
cites work: On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
cites work: Towards Performance Prediction of Compositional Models in Industrial GALS Designs
cites work: Q4535031
cites work: Q4847023
cites work: Q4484499
cites work: Comparative branching-time semantics for Markov chains
cites work: Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
cites work: Q4484498
cites work: Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
DOI: 10.1016/J.TCS.2011.07.020
description: scientific article; zbMATH DE number 6014288