Generic forward and backward simulations. II: Probabilistic simulation

DOI10.1007/978-3-642-15375-4_31zbMATH Open1285.68104OpenAlexW1518171473MaRDI QIDQ3584948FDOQ3584948

Authors: Ichiro Hasuo 

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

Recommendations

• Generic Forward and Backward Simulations
• Bisimulation for probabilistic transition systems: a coalgebraic approach
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Simulations in coalgebra
• scientific article; zbMATH DE number 794262

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)

Cited In (11)

• Coinductive predicates and final sequences in a fibration
• Generic Forward and Backward Simulations
• Fair simulation for nondeterministic and probabilistic Büchi automata: a coalgebraic perspective
• Identifying all preorders on the subdistribution monad
• Quantitative simulations by matrices
• Forward and backward simulations. I. Untimed Systems
• A calculus for generic, QoS-aware component composition
• Generic weakest precondition semantics from monads enriched with order
• Coinductive predicates and final sequences in a fibration
• Coalgebraic infinite traces and Kleisli simulations
• Relational presheaves, change of base and weak simulation

This page was built for publication: Generic forward and backward simulations. II: Probabilistic simulation

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