A hierarchy of probabilistic system types

DOI10.1016/j.tcs.2004.07.019zbMath1071.68071OpenAlexW1981607181MaRDI QIDQ703518

Ana Sokolova, Falk Bartels, E. P. de Vink

Publication date: 11 January 2005

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

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

zbMATH Keywords

CoalgebraProbabilistic bisimulationCocongruencePreservation and reflection of bisimulationProbabilistic transition systems

Mathematics Subject Classification ID

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

Related Items

Approximating Labelled Markov Processes Again! ⋮ Minimality Notions via Factorization Systems and Examples ⋮ Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence ⋮ Deriving Syntax and Axioms for Quantitative Regular Behaviours ⋮ SOS formats and meta-theory: 20 years after ⋮ A Formalized Hierarchy of Probabilistic System Types ⋮ Unnamed Item ⋮ Subsequential transducers: a coalgebraic perspective ⋮ Preservation and reflection of bisimilarity via invertible steps ⋮ Modalities in the Stone age: a comparison of coalgebraic logics ⋮ Unnamed Item ⋮ Up-to techniques for behavioural metrics via fibrations ⋮ Value-passing CCS with noisy channels ⋮ Coalgebraic semantics of modal logics: an overview ⋮ Probabilistic systems coalgebraically: a survey ⋮ A coalgebraic view on decorated traces ⋮ Branching Bisimulation Congruence for Probabilistic Systems ⋮ Differential privacy in probabilistic systems ⋮ Quantitative Kleene coalgebras ⋮ Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes ⋮ Probabilities, distribution monads, and convex categories ⋮ Bisimulation and cocongruence for probabilistic systems ⋮ Unnamed Item ⋮ Equational Coalgebraic Logic ⋮ Unnamed Item ⋮ Approximating Markov Processes by Averaging ⋮ Termination in Convex Sets of Distributions ⋮ Unnamed Item ⋮ Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems

Cites Work

• Bisimulation through probabilistic testing
• Coalgebraic logic
• Universal coalgebra: A theory of systems
• Probabilistic verification
• Reactive, generative, and stratified models of probabilistic processes
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Bisimulation for labelled Markov processes
• A final coalgebra theorem
• Validation of Stochastic Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item