Local model checking in the modal mu-calculus
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
A calculus of mobile processes, I
Information and Computation
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
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
Protocol Verification as a Hardware Design Aid
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
The Mobility Workbench - A Tool for the pi-Calculus
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
A logical encoding of the π-calculus: model checking mobile processes using tabled resolution
International Journal on Software Tools for Technology Transfer (STTT)
Principles of the Spin Model Checker
Principles of the Spin Model Checker
| Hi-index | 0.00 |
Vehicular networking is an important emerging area having immense applications, ranging from road-safety to emergency communications in disaster situations. As more applications begin to take advantage of vehicular networks, correctness of the underlying protocols must be subjected to rigorous analysis. The π-calculus is a formal language for specifying mobile systems and has been applied in wide range of settings, from specifying security protocols to modeling biomolecular systems. In this paper, we use π-calculus to construct a formal specification of a cross-layer dual-radio handoff algorithm for vehicular networks. The main challenge in this work was to use the minimal set of highly expressive and powerful constructs of π-calculus to model protocol agents at the right level of abstraction. To give two instances of our approach: (a) the two radios involved in handoff are modelled as concurrent sub-processes of the mobile node process; (b) route to the gateway is modelled as a channel that the access point supplies to both the gateway and the mobile node, both of which are modelled as concurrent processes. We formulate representative properties in a branching-time temporal logic and verify our protocol specification against these properties. Our study shows that π-calculus is a suitable formalism for modeling and verifying vehicular protocols.