Verification of parameterized communicating automata via split-width - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Verification of parameterized communicating automata via split-width

Abstract

We study verification problems for distributed systems communicating via unbounded FIFO channels. The number of processes of the system as well as the communication topology are not fixed a priori. Systems are given by parameterized communicating automata (PCAs) which can be run on any communication topology of bounded degree, with arbitrarily many processes. Such systems are Turing powerful so we concentrate on under-approximate verification. We extend the notion of split-width to behaviors of PCAs. We show that emptiness, reachability and model-checking problems of PCAs are decidable when restricted to behaviors of bounded split-width. Reachability and emptiness are Exptime-complete, but only polynomial in the size of the PCA. We also describe several concrete classes of bounded split-width, for which we prove similar results.
Fichier principal
Vignette du fichier
FG-fossacs16.pdf (545.75 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01408041 , version 1 (14-03-2017)

Identifiers

Cite

Marie Fortin, Paul Gastin. Verification of parameterized communicating automata via split-width. 19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2016), Apr 2016, Eindhoven, Netherlands. pp.197-213, ⟨10.1007/978-3-662-49630-5_12⟩. ⟨hal-01408041⟩
147 View
127 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More