A randomized protocol for signing contracts
Communications of the ACM
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Foundations of programming languages
Foundations of programming languages
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
A calculus for cryptographic protocols
Information and Computation
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Casper: a compiler for the analysis of security protocols
Journal of Computer Security
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communication and Concurrency
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Constraints for Free in Concurrent Computation
ACSC '95 Proceedings of the 1995 Asian Computing Science Conference on Algorithms, Concurrency and Knowledge
The Mobility Workbench - A Tool for the pi-Calculus
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
Parametric probabilistic sensor network routing
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
A process-algebraic approach for the analysis of probabilistic noninterference
Journal of Computer Security
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Theoretical Computer Science
Towards optimal sleep scheduling in sensor networks for rare-event detection
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Deciding knowledge in security protocols under equational theories
Theoretical Computer Science - Automated reasoning for security protocol analysis
Journal of Computer Security - Special issue on WITS'02
CC-Pi: a constraint-based language for specifying service level agreements
ESOP'07 Proceedings of the 16th European conference on Programming
Computationally Sound Symbolic Analysis of Probabilistic Protocols with Ideal Setups
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Measuring Anonymous Systems with the Probabilistic Applied Pi Calculus
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
A pure labeled transition semantics for the applied pi calculus
Information Sciences: an International Journal
A probabilistic energy-aware model for mobile ad-hoc networks
ASMTA'11 Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications
Evaluating resistance to jamming and casual interception in mobile wireless networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
Behavioural equivalences and interference metrics for mobile ad-hoc networks
Performance Evaluation
| Hi-index | 0.00 |
We propose an extension of the Applied Pi-calculus by introducing nondeterministic and probabilistic choice operators. The semantics of the resulting model, in which probability and nondeterminism are combined, is given by Segala's Probabilistic Automata driven by schedulers which resolve the nondeterministic choice among the probability distributions over target states. Notions of static and observational equivalence are given for the enriched calculus. In order to model the possible interaction of a process with its surrounding environment a labeled semantics is given together with a notion of weak bisimulation which is shown to coincide with the observational equivalence. Finally, we prove that results in the probabilistic framework are preserved in a purely nondeterministic setting.