Generic Forward and Backward Simulations II: Probabilistic Simulation
From MaRDI portal
Publication:3584948
DOI10.1007/978-3-642-15375-4_31zbMath1285.68104OpenAlexW1518171473MaRDI QIDQ3584948
Publication date: 31 August 2010
Published in: CONCUR 2010 - Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15375-4_31
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)
Related Items (8)
Coinductive predicates and final sequences in a fibration ⋮ Identifying all preorders on the subdistribution monad ⋮ Generic weakest precondition semantics from monads enriched with order ⋮ A calculus for generic, QoS-aware component composition ⋮ Quantitative simulations by matrices ⋮ Unnamed Item ⋮ Coinductive predicates and final sequences in a fibration ⋮ Relational presheaves, change of base and weak simulation
This page was built for publication: Generic Forward and Backward Simulations II: Probabilistic Simulation
