Parameterized Verification of Ad Hoc Networks

Delzanno, Giorgio; Sangnier, Arnaud; Zavattaro, Gianluigi

doi:10.1007/978-3-642-15375-4_22

Cited by 73 publications

(143 citation statements)

References 14 publications

Supporting

Mentioning

137

Contrasting

Order By: Relevance

“…models based on wqos on bounded-depth trees or graphs, whose complexity has not been analyzed [GMSZ08,DSZ10,Mey08,BKWZ13,KS14]. This is part of our current research agenda on complexity for well-structured systems [SS12].…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

The Power of Priority Channel Systems

Haase

Schmitz

Schnoebelen

2013

CONCUR 2013 – Concurrency Theory

View full text Add to dashboard Cite

Abstract. We introduce Priority Channel Systems, a new natural class of channel systems where messages carry a numeric priority and where higher-priority messages can supersede lower-priority messages preceding them in the fifo communication buffers. The decidability of safety and inevitability properties is shown via the introduction of a priority embedding, a well-quasi-ordering that has not previously been used in well-structured systems. We then show how Priority Channel Systems can compute fast-growing functions and prove that the aforementioned verification problems are Fε 0 -complete.

show abstract

Section: Discussionmentioning

confidence: 99%

“…The exact complexity of verification problems in the aforementioned models is currently unknown [GMSZ08,DSZ10,Mey08,BKWZ13,KS14]. Our encoding suggests they might be F ε 0 -complete.…”

Section: Applications Of the Priority Embedding To Treesmentioning

confidence: 97%

The Power of Priority Channel Systems

Haase

Schmitz

Schnoebelen

2013

CONCUR 2013 – Concurrency Theory

View full text Add to dashboard Cite

show abstract

“…[8,12,11,5,6]. Ad hoc networks consist of wireless hosts that, in absence of a fixed infrastructure, communicate sending broadcast messages.…”

Section: Introductionmentioning

confidence: 99%

“…In the AHN model proposed in [5] undirected graphs are used to represent a network in which each node executes an instance of a fixed (untimed) interaction protocol based on broadcast communication. Since individual nodes are not aware of the network topology, in the ad hoc setting it is natural to parameterize verification problems in the size and shape of the initial configuration as in the untimed case in [5]. We observe however that protocols for ad hoc networks are often based on time-sensitive conditions like time-outs or time-stamps (added to flooded data).…”

Section: Introductionmentioning

confidence: 99%

“…A natural combination of the AHN model in [5] and of Timed Network is obtained by adding a connectivity graph to a network of timed automata communicating via broadcast messages, we call the resulting model Timed Ad hoc Networks (TAHNs). For a fixed initial configuration, TAHNs can be specified in model checkers like Uppaal [13] by using a shared global matrix to specify the communication topology.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the Verification of Timed Ad Hoc Networks

Abdulla

Delzanno

Rezine

et al. 2011

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We study decidability and undecidability results for parameterized verification of a formal model of timed Ad Hoc network protocols. The communication topology is represented by a graph and the behavior of each node is represented by a timed automaton communicating with its neighbors via broadcast messages. We consider verification problems formulated in terms of reachability, starting from initial configurations of arbitrary size, of a configuration that contain at least one occurrence of a node in a certain state. We study the problem for dense and discrete time and compare the results with those obtained for (fully connected) networks of timed automata.

show abstract