Value-passing CCS with noisy channels
From MaRDI portal
Publication:428864
DOI10.1016/j.tcs.2012.03.002zbMath1251.68157OpenAlexW2031805159MaRDI QIDQ428864
Hanpin Wang, Wanling Qu, Yongzhi Cao, Shuqin Huang
Publication date: 25 June 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.002
Semantics in the theory of computing (68Q55) 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
Behavioural equivalences of a probabilistic pi-calculus, Non-deterministic transducer models of retransmission protocols over noisy channels
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Metrics for labelled Markov processes
- Symbolic bisimulations
- Undecidable verification problems for programs with unreliable channels
- A hierarchy of probabilistic system types
- Axiomatizations for probabilistic finite-state behaviors
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
- Quantifying information leakage in process calculi
- Algebra of communicating processes with abstraction
- A calculus of communicating systems
- Bisimulation through probabilistic testing
- A proof system for communicating processes with value-passing
- A calculus of mobile processes. I
- A calculus of mobile processes. II
- Reasoning about probabilistic sequential programs in a probabilistic logic
- Bisimulation indexes and their applications
- A behavioural pseudometric for probabilistic transition systems
- \(\pi\)-calculus with noisy channels
- Verification of probabilistic systems with faulty communication
- Probabilistic Barbed Congruence
- Timed, Distributed, Probabilistic, Typed Processes
- Quantifying Information Leakage in Process Calculi
- Measuring the Speed of Information Leakage in Mobile Processes
- Algebraic laws for nondeterminism and concurrency
- The Two-Phase Commitment Protocol in an Extended π-Calculus
- Reactive Systems
- CONCUR 2004 - Concurrency Theory
- Validation of Stochastic Systems
- Non Expansive ε-Bisimulations
- Quantifying Probabilistic Information Flow in Computational Reactive Systems
- CONCUR 2003 - Concurrency Theory
