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, I
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
Communication and concurrency
Bisimulations for a calculus of broadcasting systems
Theoretical Computer Science
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
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
Towards a Calculus For Wireless Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A theory for observational fault tolerance
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Formal Models and Analysis of Secure Multicast in Wired and Wireless Networks
Journal of Automated Reasoning
An Observational Theory for Mobile Ad Hoc Networks (full version)
Information and Computation
A Calculus for Mobile Ad-hoc Networks with Static Location Binding
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Mobility Models and Behavioural Equivalence for Wireless Networks
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
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
A process calculus for mobile ad hoc networks
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Depletable channels: dynamics and behaviour
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Equational reasoning on ad hoc networks
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Observables for mobile and wireless broadcasting systems
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
Topology-dependent abstractions of broadcast networks
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Broadcast abstraction in a stochastic calculus for mobile networks
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |
We propose a process calculus to study the observational 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 simulation and bisimulation for ad hoc networks. As a main result, we prove that the (weak) labelled bisimilarity completely characterises (weak) reduction barbed congruence, a standard, branching-time, contextually-defined program equivalence. We then use our (bi)simulation proof methods to formally prove a number of non-trivial properties of ad hoc networks.