-calculus with noisy channels

DOI10.1007/S00236-005-0168-0zbMATH Open1079.68067OpenAlexW2155105871MaRDI QIDQ2570971FDOQ2570971

Authors: Mingsheng Ying 

Publication date: 31 October 2005

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10453/9040

Recommendations

• A calculus of mobile processes. I
• scientific article; zbMATH DE number 1420796
• Value-passing CCS with noisy channels
• A Probabilistic Applied Pi–Calculus
• scientific article; zbMATH DE number 1296290

zbMATH Keywords

Shannon's information theoryvalue-passing process algebras

Mathematics Subject Classification ID

Information theory (general) (94A15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• A Mathematical Theory of Communication
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bisimulation for higher-order process calculi
• Bisimulation through probabilistic testing
• A calculus of mobile processes. II
• Title not available (Why is that?)
• Algebra of communicating processes with abstraction
• A calculus of communicating systems
• Model theory.
• Communicating sequential processes
• Title not available (Why is that?)
• Using forward reachability analysis for verification of lossy channel systems
• Verifying programs with unreliable channels
• Undecidable verification problems for programs with unreliable channels
• Reactive, generative, and stratified models of probabilistic processes
• A Theory of Communicating Sequential Processes
• The \(\pi\)-calculus: A theory of mobile processes
• On reduction-based process semantics
• Algebraic theory of probabilistic processes.
• Bisimulation indexes and their applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Axiomatizing probabilistic processes: ACP with generative probabilities
• Probabilistic communicating processes
• Reasoning about probabilistic sequential programs in a probabilistic logic
• Testing preorders for probabilistic processes.
• Some congruence properties for \(\pi\)-calculus bisimilarities
• Title not available (Why is that?)
• The two-phase commitment protocol in an extended \(\pi\)-calculus
• CONCUR 2004 - Concurrency Theory
• Additive models of probabilistic processes
• Title not available (Why is that?)
• Plain CHOCS. A second generation calculus for higher order processes
• Lectures on Formal methods and performance analysis. 1st EEF/Euro summer school on trends in computer science, Berg en Dal, the Netherlands, July 3--7, 2000. Revised lectures
• Title not available (Why is that?)
• Validation of Stochastic Systems
• Title not available (Why is that?)
• Recursive equations in higher-order process calculi

Cited In (5)

• Approximating Markov processes through filtration
• A modal characterization of alternating approximate bisimilarity
• Implementation and Application of Automata
• Behavioural equivalences of a probabilistic pi-calculus
• Value-passing CCS with noisy channels

This page was built for publication: \(\pi\)-calculus with noisy channels

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