Parameterized Verification of Broadcast Networks of Register Automata

Delzanno, Giorgio; Sangnier, Arnaud; Traverso, Riccardo

doi:10.1007/978-3-642-41036-9_11

Cited by 22 publications

(24 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, one may consider model checking against temporal logics, and automata models that run over topologies of unbounded degree such as star topologies and unranked trees. These models may include registers so that a process can remember some of its neighbors [8].…”

Section: Resultsmentioning

confidence: 99%

Parameterized Verification of Communicating Automata under Context Bounds

Bollig

Gastin

Schubert

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We study the verification problem for parameterized communicating automata (PCA), in which processes synchronize via message passing. A given PCA can be run on any topology of bounded degree (such as pipelines, rings, or ranked trees), and communication may take place between any two processes that are adjacent in the topology. Parameterized verification asks if there is a topology from a given topology class that allows for an accepting run of the given PCA. In general, this problem is undecidable even for synchronous communication and simple pipeline topologies. We therefore consider context-bounded verification, which restricts the behavior of each single process. For several variants of context bounds, we show that parameterized verification over pipelines, rings, and ranked trees is decidable. More precisely, it is PSPACE-complete for pipelines and rings, and EXPTIME-complete for ranked trees. Our approach is automata-theoretic. We build a finite (tree, respectively) automaton that identifies those topologies that allow for an accepting run of the given PCA. The verification problem then reduces to checking nonemptiness of that automaton.

show abstract

Section: Resultsmentioning

confidence: 99%

Parameterized Verification of Communicating Automata under Context Bounds

Bollig

Gastin

Schubert

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This approach is not applicable in our case due to our network topologies, and that the nodes do not use such thresholds. Parameterized verification results on processes with unique identifiers are more rare but decidability was obtained under some restrictions [12].…”

Section: Parameterized Verificationmentioning

confidence: 99%

An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP

Sankur

Talpin

2017

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. We consider distributed timed systems that implement leader election protocols which are at the heart of clock synchronization protocols. We develop abstraction techniques for parameterized model checking of such protocols under arbitrary network topologies, where nodes have independently evolving clocks. We apply our technique for model checking the root election part of the flooding time synchronisation protocol (FTSP), and obtain improved results compared to previous work. We model check the protocol for all topologies in which the distance to the node to be elected leader is bounded by a given parameter.

show abstract

“…Indeed, in this setting the topology of the network cannot be exploited to build structures that could be applied to model an unbounded storage. In a more recent work [2], we have characterized its complexity.…”

Section: Theorem 1 Cover Is Undecidablementioning

confidence: 99%

“…Decidability holds only when receivers ignore corrupted messages by remaining in their original state. Moreover, for the verification task in the decidable variants we show that it is possible to resort to the polynomial time reachability algorithm for a model of ad hoc networks with nondeterministic mobility presented in [2].…”

Section: Introductionmentioning

confidence: 99%

Verification of Ad Hoc Networks with Node and Communication Failures

Delzanno

Sangnier

Zavattaro

2012

Formal Techniques for Distributed Systems

Self Cite

View full text Add to dashboard Cite

Abstract. We investigate the impact of node and communication failures on the decidability and complexity of parametric verification of a formal model of ad hoc networks. We start by considering three possible types of node failures: intermittence, restart, and crash. Then we move to three cases of communication failures: nondeterministic message loss, message loss due to conflicting emissions, and detectable conflicts. Interestingly, we prove that the considered decision problem (reachability of a control state) is decidable for node intermittence and message loss (either nondeterministic or due to conflicts) while it turns out to be undecidable for node restart/crash, and conflict detection.

show abstract

Parameterized Verification of Broadcast Networks of Register Automata

Cited by 22 publications

References 19 publications

Parameterized Verification of Communicating Automata under Context Bounds

Parameterized Verification of Communicating Automata under Context Bounds

An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP

Verification of Ad Hoc Networks with Node and Communication Failures

Contact Info

Product

Resources

About