Parameterized verification of time-sensitive models of ad hoc network protocols
2016 (English)In: Theoretical Computer Science, ISSN 0304-3975, E-ISSN 1879-2294, Vol. 612, 1-22 p.Article in journal (Refereed) PublishedText
We study decidability and undecidability results for parameterized verification of a formal model of timed Ad Hoc network protocols. The communication topology is defined by an undirected graph and the behaviour of each node is defined by a timed automaton communicating with its neighbours via broadcast messages. We consider parameterized verification problems formulated in terms of reachability. In particular we are interested in searching for an initial configuration from which an individual node can reach an error state. We study the problem for dense and discrete time and compare the results with those obtained for (fully connected) networks of timed automata.
Place, publisher, year, edition, pages
2016. Vol. 612, 1-22 p.
Parameterized verification, Timed automata, Ad hoc networks, Graphs, Decidability, Well structured transition systems
IdentifiersURN: urn:nbn:se:uu:diva-279630DOI: 10.1016/j.tcs.2015.07.048ISI: 000369211200001OAI: oai:DiVA.org:uu-279630DiVA: diva2:909999