A calculus of broadcasting systems
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
A calculus of broadcasting systems
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Expressiveness of Point-to-Point versus Broadcast Communications
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
A framework for security analysis of mobile wireless networks
Theoretical Computer Science - Automated reasoning for security protocol analysis
Restricted Broadcast Process Theory
SEFM '08 Proceedings of the 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods
An Observational Theory for Mobile Ad Hoc Networks (full version)
Information and Computation
Psi-calculi: Mobile Processes, Nominal Data, and Logic
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Towards a Calculus For Wireless Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
An operational semantics for a calculus for wireless systems
Theoretical Computer Science
A process calculus for Mobile Ad Hoc Networks
Science of Computer Programming
A calculus for mobile ad hoc networks
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
Nominal techniques in Isabelle/HOL
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Observables for mobile and wireless broadcasting systems
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
Hi-index | 0.00 |
Psi-calculi is a parametric framework for extensions of the pi-calculus, with arbitrary data structures and logical assertions for facts about data. In this paper we add primitives for broadcast communication in order to model wireless protocols. The additions preserve the purity of the psi-calculi semantics, and we formally prove the standard congruence and structural properties of bisimilarity. We demonstrate the expressive power of broadcast psi-calculi by modelling the wireless ad-hoc routing protocol LUNAR and verifying a basic reachability property.