Statecharts: A visual formalism for complex systems
Science of Computer Programming
The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
A calculus of mobile processes, II
Information and Computation
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
A calculus of broadcasting systems
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Bisimulations for a calculus of broadcasting systems
Theoretical Computer Science
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Towards a primitive higher order calculus of broadcasting systems
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
A Broadcast-based Calculus for Communicating Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
A Calculus of Value Broadcasts
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A theory of system behaviour in the presence of node and link failures
CONCUR 2005 - Concurrency Theory
A framework for security analysis of mobile wireless networks
Theoretical Computer Science - Automated reasoning for security protocol analysis
An Observational Theory for Mobile Ad Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Calculus For Wireless Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A calculus for mobile ad hoc networks
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
A theory for observational fault tolerance
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Authenticated routing for ad hoc networks
IEEE Journal on Selected Areas in Communications
Parameterized verification of ad hoc networks
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
A calculus for the analysis of wireless network security protocols
FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
A process calculus for dynamic networks
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
A timed calculus for wireless systems
Theoretical Computer Science
Broadcast psi-calculi with an application to wireless protocols
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
A timed calculus for wireless systems
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
A calculus of trustworthy ad hoc networks
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
A process algebra for wireless mesh networks
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
A semantic analysis of wireless network security protocols
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Verification of ad hoc networks with node and communication failures
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
A semantic analysis of key management protocols for wireless sensor networks
Science of Computer Programming
Behavioural equivalences and interference metrics for mobile ad-hoc networks
Performance Evaluation
| Hi-index | 0.00 |
We propose a process calculus to study the behavioural theory of Mobile Ad Hoc Networks. The operational semantics of our calculus is given both in terms of a Reduction Semantics and in terms of a Labelled Transition Semantics. We prove that the two semantics coincide. The labelled transition system is then used to derive the notions of (weak) simulation and bisimulation for ad hoc networks. The labelled bisimilarity completely characterises reduction barbed congruence, a standard branching-time and contextually-defined program equivalence. We then use our (bi)simulation proof method to formally prove a number of non-trivial properties of ad hoc networks.