Branching bisimulation for probabilistic systems: characteristics and decidability

DOI10.1016/J.TCS.2006.02.010MaRDI QIDQ2491633zbMATH OpenOpenAlexFDO

Authors S. Andova, T. 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

zbMATH Keywords

abstractionalternating modelbranching bisimulationprobabilistic systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Equivalences for silent transitions in probabilistic systems (extended abstract)
• Branching bisimulation congruence for probabilistic systems
• Branching bisimulation congruence for probabilistic systems
• On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
• scientific article; zbMATH DE number 1701760

Cites work

• Bisimulation can't be traced
• Bisimulation through probabilistic testing
• Branching time and abstraction in bisimulation semantics
• scientific article; zbMATH DE number 1701760 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 177845 (Why is no real title available?)
• scientific article; zbMATH DE number 1927573 (Why is no real title available?)
• scientific article; zbMATH DE number 1927574 (Why is no real title available?)
• scientific article; zbMATH DE number 1512606 (Why is no real title available?)
• scientific article; zbMATH DE number 1754605 (Why is no real title available?)
• scientific article; zbMATH DE number 1759621 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• Process Algebra
• Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
• Three logics for branching bisimulation

Cited in

(24)

• SOS specifications for uniformly continuous operators
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Stuttering for abstract probabilistic automata
• scientific article; zbMATH DE number 1701760 (Why is no real title available?)
• Remarks on testing probabilistic processes
• Computing Behavioral Relations for Probabilistic Concurrent Systems
• Probabilistic Bisimulation: Naturally on Distributions
• Stuttering for abstract probabilistic automata
• On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• scientific article; zbMATH DE number 1927574 (Why is no real title available?)
• scientific article; zbMATH DE number 1512606 (Why is no real title available?)
• scientific article; zbMATH DE number 1759621 (Why is no real title available?)
• Game characterization of probabilistic bisimilarity, and applications to pushdown automata
• Bisimulations, logics, and trace distributions for stochastic systems with rewards
• SOS-based modal decomposition on nondeterministic probabilistic processes
• Polynomial time decision algorithms for probabilistic automata
• Branching bisimulation congruence for probabilistic systems
• A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
• A cancellation law for probabilistic processes
• Branching bisimulation congruence for probabilistic systems
• Raiders of the lost equivalence: probabilistic branching bisimilarity
• A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
• Model independent approach to probabilistic models

This page was built for publication: Branching bisimulation for probabilistic systems: characteristics and decidability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2491633)