Branching bisimulation for probabilistic systems: characteristics and decidability
From MaRDI portal
Publication:2491633
DOI10.1016/j.tcs.2006.02.010zbMath1092.68062OpenAlexW2110586188MaRDI QIDQ2491633
Suzana Andova, Tim A. C. Willemse
Publication date: 29 May 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/branching-bisimulation-for-probabilistic-systems-characteristics-and-decidability(60d22ae1-c692-41e1-8c0e-49868198d17f).html
Related Items (15)
A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces ⋮ Model independent approach to probabilistic models ⋮ Stuttering for Abstract Probabilistic Automata ⋮ Computing Behavioral Relations for Probabilistic Concurrent Systems ⋮ SOS specifications for uniformly continuous operators ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Stuttering for abstract probabilistic automata ⋮ Polynomial time decision algorithms for probabilistic automata ⋮ Branching Bisimulation Congruence for Probabilistic Systems ⋮ Unnamed Item ⋮ On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems ⋮ Unnamed Item ⋮ Branching bisimulation congruence for probabilistic systems ⋮ Raiders of the lost equivalence: probabilistic branching bisimilarity ⋮ Remarks on Testing Probabilistic Processes
Cites Work
- Bisimulation through probabilistic testing
- Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
- Process Algebra
- Bisimulation can't be traced
- Three logics for branching bisimulation
- Branching time and abstraction in bisimulation semantics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Branching bisimulation for probabilistic systems: characteristics and decidability