Sciweavers

276 search results - page 15 / 56
» Bisimulation for quantum processes
Sort
View
CALCO
2005
Springer
76views Mathematics» more  CALCO 2005»
14 years 2 months ago
Strong Splitting Bisimulation Equivalence
We present ACPc , a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms fo...
Jan A. Bergstra, C. A. Middelburg
LICS
1999
IEEE
14 years 1 months ago
Proof Techniques for Cryptographic Processes
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
Michele Boreale, Rocco De Nicola, Rosario Pugliese
CONCUR
2003
Springer
14 years 2 months ago
A Process-Algebraic Language for Probabilistic I/O Automata
We present a process-algebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “input-enabled” property, w...
Eugene W. Stark, Rance Cleaveland, Scott A. Smolka
APLAS
2009
ACM
14 years 3 months ago
The Higher-Order, Call-by-Value Applied Pi-Calculus
We define a higher-order process calculus with algebraic operations such as encryption and decryption, and develop a bisimulation proof method for behavioral equivalence in this c...
Nobuyuki Sato, Eijiro Sumii
CONCUR
2003
Springer
14 years 2 months ago
Priority Rewrite Systems for OSOS Process Languages
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
Irek Ulidowski