On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks

Abstract : We investigate the impact of dynamic topology reconfiguration on the complexity of verification problems for models of protocols with broadcast communication. We first consider reachability of a configuration with a given set of control states and show that parameterized verification is decidable with polynomial time complexity. We then move to richer queries and show how the complexity changes when considering properties with negation or cardinality constraints.
Document type :
Reports
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00740518
Contributor : Arnaud Sangnier <>
Submitted on : Wednesday, October 10, 2012 - 2:01:30 PM
Last modification on : Friday, January 4, 2019 - 5:32:56 PM
Long-term archiving on : Friday, January 11, 2013 - 3:41:12 AM

Files

fsttcs12-long.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00740518, version 1

Collections

Citation

Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso, Gianluigi Zavattaro. On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks. 2012. ⟨hal-00740518⟩

Share

Metrics

Record views

577

Files downloads

222