Value-passing CCS with noisy channels

DOI10.1016/J.TCS.2012.03.002MaRDI QIDQ428864zbMATHOpenAlexFDO

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

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)

Recommendations

• \(\pi\)-calculus with noisy channels
• scientific article; zbMATH DE number 4205976
• 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

Cites work

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

Cited in

(3)

• \(\pi\)-calculus with noisy channels
• Non-deterministic transducer models of retransmission protocols over 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)