Action versus state based logics for transition systems
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
A calculus of broadcasting systems
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Parametric shape analysis via 3-valued logic
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information Processing Letters
Principles of Program Analysis
Principles of Program Analysis
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Formal verification of standards for distance vector routing protocols
Journal of the ACM (JACM)
A Kleene Analysis of Mobile Ambients
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
A Broadcast-based Calculus for Communicating Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Model Checking Partial State Spaces with 3-Valued Temporal Logics
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
ARES '06 Proceedings of the First International Conference on Availability, Reliability and Security
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)
Program analysis and compilation, theory and practice
Modal Abstractions of Concurrent Behaviour
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Computer Languages, Systems and Structures
Mobility Models and Behavioural Equivalence for Wireless Networks
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Modal abstractions of concurrent behavior
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Broadcast semantics poses significant challenges over point-to-point communication when it comes to formal modelling and analysis. Current approaches to analysing broadcast networks have focused on fixed connectivities, but this is unsuitable in the case of wireless networks where the dynamically changing network topology is a crucial ingredient. In this paper we develop a static analysis that automatically constructs an abstract transition system, labelled by actions and connectivity information, to yield a mobility-preserving finite abstraction of the behaviour of a network expressed in a process calculus with asynchronous local broadcast. Furthermore, we use model checking based on a 3-valued temporal logic to distinguish network behaviour which differs under changing connectivity patterns.