Probabilistic weak bisimulation and axiomatization for probabilistic models
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1759621 (Why is no real title available?)
- A Probabilistic Applied Pi–Calculus
- A complete axiomatisation for observational congruence of finite-state behaviours
- Additive models of probabilistic processes
- Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours
- Axiomatizations for probabilistic finite-state behaviors
- Bisimulation through probabilistic testing
- Branching time and abstraction in bisimulation semantics
- CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
- Model independent approach to probabilistic models
- Reactive, generative, and stratified models of probabilistic processes
- Semantics of probabilistic processes. An operational approach
Cited in
(7)- Branching bisimulation semantics for quantum processes
- scientific article; zbMATH DE number 1759621 (Why is no real title available?)
- Weak bisimulation for probabilistic timed automata
- A unifying approach to probabilistic testing equivalences
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi
- Foundations of Software Science and Computational Structures
- scientific article; zbMATH DE number 1754605 (Why is no real title available?)
This page was built for publication: Probabilistic weak bisimulation and axiomatization for probabilistic models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6161460)