Branching bisimulation congruence for probabilistic systems

DOI10.1016/J.TCS.2011.07.020MaRDI QIDQ764289zbMATH OpenOpenAlexFDO

Authors S. Andova, Sonja Georgievska, Nikola Trčka

Publication date 13 March 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2011.07.020

zbMATH Keywords

probabilisticprocess algebrabranching bisimulationnondeterministic systemsparallel compositionPCTL

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Branching bisimulation congruence for probabilistic systems
• Branching bisimulation for probabilistic systems: characteristics and decidability
• On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
• Equivalences for silent transitions in probabilistic systems (extended abstract)
• Probabilistic divide \& congruence: branching bisimilarity

Cites work

• scientific article; zbMATH DE number 1701760 (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 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?)
• scientific article; zbMATH DE number 7280017 (Why is no real title available?)
• A calculus of communicating systems
• Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
• Bisimulation through probabilistic testing
• Branching bisimulation congruence for probabilistic systems
• Branching bisimulation for probabilistic systems: characteristics and decidability
• Branching time and abstraction in bisimulation semantics
• Branching time and orthogonal bisimulation equivalence
• CONCUR 2005 – Concurrency Theory
• Comparative branching-time semantics for Markov chains
• Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
• Model checking of probabilistic and nondeterministic systems
• Observing branching structure through probabilistic contexts
• On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
• Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Three logics for branching bisimulation
• Towards Performance Prediction of Compositional Models in Industrial GALS Designs
• Validation of Stochastic Systems

Cited in

(22)

• Probabilistic divide \& congruence: branching bisimilarity
• A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
• Model independent approach to probabilistic models
• Branching bisimulation congruence for probabilistic systems
• scientific article; zbMATH DE number 1701760 (Why is no real title available?)
• scientific article; zbMATH DE number 1759621 (Why is no real title available?)
• Approximate analyzing of labeled transition systems
• Back to the format: a survey on SOS for probabilistic processes
• scientific article; zbMATH DE number 1927574 (Why is no real title available?)
• 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
• Branching bisimulation for probabilistic systems: characteristics and decidability
• Probabilistic Bisimulation: Naturally on Distributions
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Probabilistic bisimulation as a congruence
• Probabilistic transition system specification: congruence and full abstraction of bisimulation
• Bisimulations, logics, and trace distributions for stochastic systems with rewards
• Raiders of the lost equivalence: probabilistic branching bisimilarity
• Probabilistic barbed congruence
• Similarity-based minimization of fuzzy tree automata
• scientific article; zbMATH DE number 1512606 (Why is no real title available?)
• scientific article; zbMATH DE number 1754605 (Why is no real title available?)

This page was built for publication: Branching bisimulation congruence for probabilistic systems

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