Subgraphs and well-quasi-ordering
Journal of Graph Theory
A calculus of broadcasting systems
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
Well-structured transition systems everywhere!
Theoretical Computer Science
A Broadcast-based Calculus for Communicating Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On Model Checking for Non-Deterministic Infinite-State Systems
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
On the Verification of Broadcast Protocols
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Computation: finite and infinite machines
Computation: finite and infinite machines
An Observational Theory for Mobile Ad Hoc Networks (full version)
Information and Computation
Query-Based Model Checking of Ad Hoc Network Protocols
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
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
Modelling and verification of the LMAC protocol for wireless sensor networks
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
A process calculus for mobile ad hoc networks
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Graph grammar modeling and verification of ad hoc routing protocols
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Graph grammar modeling and verification of ad hoc routing protocols
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Forward analysis of depth-bounded processes
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
On the power of cliques in the parameterized verification of Ad Hoc networks
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
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
On the verification of timed ad hoc networks
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Multiset rewriting for the verification of depth-bounded processes with name binding
Information and Computation
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
Reachability of communicating timed processes
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Parameterized verification of asynchronous shared-memory systems
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
The power of priority channel systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
We study decision problems for parameterized verification of a formal model of Ad Hoc Networks with selective broadcast and spontaneous movement. The communication topology of a network is represented as a graph. Nodes represent states of individual processes. Adjacent nodes represent single-hop neighbors. Processes are finite state automata that communicate via selective broadcast messages. Reception of a broadcast is restricted to single-hop neighbors. For this model we consider verification problems that can be expressed as reachability of configurations with one node (resp. all nodes) in a certain state from an initial configuration with an arbitrary number of nodes and unknown topology. We draw a complete picture of the decidability boundaries of these problems according to different assumptions on communication graphs, namely static, mobile, and bounded path topology.