The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
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
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Testing Probabilistic and Nondeterministic Processes
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Axiomatizations for Probabilistic Bisimulation
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Mobile Processes with a Distributed Environment
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Compositional Methods for Probabilistic Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A randomized encoding of the π-calculus with mixed choice
Theoretical Computer Science - Process algebra
CONCUR 2005 - Concurrency Theory
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Epistemic Strategies and Games on Concurrent Processes
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Bisimulation for Demonic Schedulers
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
On recursion, replication and scope mechanisms in process calculi
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
Time-bounded task-PIOAs: a framework for analyzing security protocols
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Compositional reasoning for probabilistic finite-state behaviors
Processes, Terms and Cycles
Journal of the ACM (JACM)
Probabilistic CSP: preserving the laws via restricted schedulers
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Epistemic Strategies and Games on Concurrent Processes
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to resolve the nondeterminism. It has been observed that for certain applications, notably those in security, the scheduler needs to be restricted so not to reveal the outcome of the protocol's random choices, or otherwise the model of adversary would be too strong even for ''obviously correct'' protocols. We propose a process-algebraic framework in which the control on the scheduler can be specified in syntactic terms, and we show how to apply it to solve the problem mentioned above. We also consider the definition of (probabilistic) may and must preorders, and we show that they are precongruences with respect to the restricted schedulers. Furthermore, we show that all the operators of the language, except replication, distribute over probabilistic summation, which is a useful property for verification.