Behavioural equivalences of a probabilistic pi-calculus
From MaRDI portal
Publication:362281
DOI10.1007/s11432-012-4660-1zbMath1270.68209OpenAlexW2065703859MaRDI QIDQ362281
Weien Chen, Hanpin Wang, Yongzhi Cao
Publication date: 20 August 2013
Published in: Science China. Information Sciences (Search for Journal in Brave)
Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-012-4660-1
behavioural equivalenceprobabilistic bisimulationprobabilistic barbed bisimulationprobabilistic pi-calculus
Specification and verification (program logics, model checking, etc.) (68Q60) 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)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Value-passing CCS with noisy channels
- Probabilistic communicating processes
- Calculi for synchrony and asynchrony
- Algebra of communicating processes with abstraction
- A calculus of communicating systems
- Bisimulation through probabilistic testing
- A calculus of mobile processes. I
- Testing equivalences for processes
- Reactive, generative, and stratified models of probabilistic processes
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Probabilistic event structures and domains
- \(\pi\)-calculus with noisy channels
- Probabilistic π-Calculus and Event Structures
- Communicating sequential processes
- Reliability of Mobile Processes with Noisy Channels
- Validation of Stochastic Systems
- Trustworthy Global Computing
- CONCUR 2005 – Concurrency Theory
- Process algebra for performance evaluation