Axiomatizations for probabilistic finite-state behaviors
From MaRDI portal
Publication:875517
DOI10.1016/j.tcs.2006.12.008zbMath1111.68081OpenAlexW2152398409MaRDI QIDQ875517
Catuscia Palamidessi, Yu-xin Deng
Publication date: 13 April 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.12.008
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (10)
Complete axiomatization for the total variation distance of Markov chains ⋮ Model independent approach to probabilistic models ⋮ Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Finite axiomatization for symbolic probabilistic \(\pi \)-calculus ⋮ Probabilistic weak bisimulation and axiomatization for probabilistic models ⋮ Value-passing CCS with noisy channels ⋮ Unnamed Item ⋮ Monads and Quantitative Equational Theories for Nondeterminism and Probability ⋮ Probabilistic Barbed Congruence
Cites Work
- A randomized encoding of the \(\pi\)-calculus with mixed choice
- A complete inference system for a class of regular behaviours
- A complete axiomatisation for observational congruence of finite-state behaviours
- Tau laws for pi calculus
- Reactive, generative, and stratified models of probabilistic processes
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Equational Axioms for Probabilistic Bisimilarity
- Validation of Stochastic Systems
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Axiomatizations for probabilistic finite-state behaviors
