Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Bisimulation through probabilistic testing
Information and Computation
A calculus of mobile processes, I
Information and Computation
A calculus of mobile processes, II
Information and Computation
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Undecidable verification problems for programs with unreliable channels
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Topology in process calculus: approximate correctness and infinite evolution of concurrent programs
Topology in process calculus: approximate correctness and infinite evolution of concurrent programs
Communication and Concurrency
Computer Networks
A Calculus of Communicating Systems
A Calculus of Communicating Systems
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Bisimulation indexes and their applications
Theoretical Computer Science
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Effective Lossy Queue Languages
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Probabilistic Lossy Channel Systems
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
A hierarchy of probabilistic system types
Theoretical Computer Science - Selected papers of CMCS'03
A behavioural pseudometric for probabilistic transition systems
Theoretical Computer Science - Automata, languages and programming
Axiomatizations for probabilistic finite-state behaviors
Theoretical Computer Science
Quantitative analysis of leakage for multi-threaded programs
Proceedings of the 2007 workshop on Programming languages and analysis for security
Reactive Systems: Modelling, Specification and Verification
Reactive Systems: Modelling, Specification and Verification
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Quantifying information leakage in process calculi
Information and Computation
A Hierarchy of Behavioral Equivalences in the π-calculus with Noisy Channels
The Computer Journal
Metrics for Action-labelled Quantitative Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of probabilistic systems with faulty communication
Information and Computation
Non-expansive ε-bisimulations for probabilistic processes
Theoretical Computer Science
Timed, distributed, probabilistic, typed processes
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Quantifying information leakage in process calculi
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Quantifying probabilistic information flow in computational reactive systems
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Measuring the speed of information leakage in mobile processes
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
| Hi-index | 5.23 |
Value-passing CCS, a full version of Milner's CCS, is a process algebra in which actions consist of sending and receiving values through noiseless communication channels. The full calculus is a succinct yet expressive language for the specification and verification of reactive systems. Taking into account the reality of channel noise in reactive systems, in this paper we introduce an extension of value-passing CCS, called value-passing CCS with noisy channels (VCCS"N), in which noise is described by a probability distribution over the values. After presenting the reduction operational semantics and labelled operational semantics of VCCS"N, we develop the theory of behavioural equivalence by introducing barbed equivalence, barbed congruence, bisimilarity, and full bisimilarity. In particular, we show that barbed equivalence and barbed congruence coincide with bisimilarity and full bisimilarity, respectively. Based upon the labelled operational semantics of VCCS"N, we establish a probabilistic modal logic for expressing system properties and show its connection with the notion of bisimilarity. Finally, we use VCCS"N to model a communication protocol for ensuring the reliable transmission of data across an error-prone channel.