Compositionality of approximate bisimulation for probabilistic systems

MaRDI QIDQ4992498zbMATH OpenFDO

Authors Daniel Gebler, Simone Tini

Publication date 9 June 2021

Full work available at URL https://arxiv.org/abs/1307.7442, http://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESSSOS13.4

Mathematics Subject Classification ID

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

Recommendations

• Probabilistic transition system specification: congruence and full abstraction of bisimulation
• SOS rule formats for convex and abstract probabilistic bisimulations
• Probabilistic bisimulation as a congruence
• Fixed-point characterization of compositionality properties of probabilistic processes combinators
• On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems

Cited in

(19)

• SOS specifications for uniformly continuous operators
• The approximate correctness of systems based on \(\delta\)-bisimulation
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
• Probabilistic divide \& congruence: branching bisimilarity
• Unwinding biological systems
• A general SOS theory for the specification of probabilistic transition systems
• Leveraging weighted automata in compositional reasoning about concurrent probabilistic systems
• Probabilistic model of software approximate correctness
• Compositional bisimulation metric reasoning with Probabilistic Process Calculi
• The Complexity of Synthesis from Probabilistic Components
• scientific article; zbMATH DE number 1759621 (Why is no real title available?)
• Equational reasonings in wireless network gossip protocols
• Fixed-point characterization of compositionality properties of probabilistic processes combinators
• Sound approximate and asymptotic probabilistic bisimulations for PCTL
• Back to the format: a survey on SOS for probabilistic processes
• The way we were: structural operational semantics research in perspective
• A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
• Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes

This page was built for publication: Compositionality of approximate bisimulation for probabilistic systems

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