Value-passing CCS with noisy channels

DOI10.1016/J.TCS.2012.03.002zbMATH Open1251.68157OpenAlexW2031805159MaRDI QIDQ428864FDOQ428864

Authors: Shuqin Huang, Yongzhi Cao, Hanpin Wang, Wanling Qu 

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

Recommendations

• \(\pi\)-calculus with noisy channels
• scientific article
• scientific article; zbMATH DE number 3846850
• A theory of communicating processes with value passing
• A semantic theory for value-passing processes based on the late approach

zbMATH Keywords

bisimilaritybarbed congruencenoisy channelprobabilistic modal logicvalue-passing CCS

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• A Mathematical Theory of Communication
• Title not available (Why is that?)
• Algebraic laws for nondeterminism and concurrency
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bisimulation through probabilistic testing
• A calculus of mobile processes. I
• A calculus of mobile processes. II
• Metrics for labelled Markov processes
• Algebra of communicating processes with abstraction
• A calculus of communicating systems
• Reactive Systems
• Undecidable verification problems for programs with unreliable channels
• The \(\pi\)-calculus: A theory of mobile processes
• Bisimulation indexes and their applications
• A behavioural pseudometric for probabilistic transition systems
• Title not available (Why is that?)
• \(\pi\)-calculus with noisy channels
• Validation of Stochastic Systems
• Reasoning about probabilistic sequential programs in a probabilistic logic
• Quantifying Information Leakage in Process Calculi
• Axiomatizations for probabilistic finite-state behaviors
• Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
• A hierarchy of probabilistic system types
• Quantifying information leakage in process calculi
• A proof system for communicating processes with value-passing
• Verification of probabilistic systems with faulty communication
• A symbolic approach to value-passing processes
• Probabilistic extensions of process algebras.
• Probabilistic barbed congruence
• Timed, Distributed, Probabilistic, Typed Processes
• Measuring the Speed of Information Leakage in Mobile Processes
• Title not available (Why is that?)
• The two-phase commitment protocol in an extended \(\pi\)-calculus
• CONCUR 2004 - Concurrency Theory
• Non Expansive ε-Bisimulations
• Quantifying probabilistic information flow in computational reactive systems
• Quantitative relations and approximate process equivalences.
• Symbolic bisimulations

Cited In (3)

• Non-deterministic transducer models of retransmission protocols over noisy channels
• \(\pi\)-calculus with noisy channels
• Behavioural equivalences of a probabilistic pi-calculus

This page was built for publication: Value-passing CCS with noisy channels

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