The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
Dynamic Logic
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
The logic of public announcements, common knowledge, and private suspicions
The logic of public announcements, common knowledge, and private suspicions
Epistemic Verification of Anonymity
Electronic Notes in Theoretical Computer Science (ENTCS)
Logics of communication and change
Information and Computation
Dynamic Epistemic Logic
Epistemic Logic for the Applied Pi Calculus
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Observing distributed computation: a dynamic-epistemic approach
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
| Hi-index | 0.00 |
The π-calculus process algebra describes the interaction of concurrent and communicating processes. The π-calculus, however, has neither explicit agency nor epistemic capabilities. In this paper, we present the formal syntax and semantics of a multi-agent dynamic epistemic logic. In this logic, the epistemic actions of agents are π-calculus processes. A process of the language is translated to a class of model updating functions reflecting the epistemic changes after the execution of such processes. Our proposal combines the capabilities of two approaches: it is possible to model structured interaction among agents as elaborated π-calculus programs, and it is also possible to describe the dynamic knowledge implications of such programs. We show the utility of our language by encoding the Dining Cryptographers protocol.