Reachability in Parameterized Systems: All Flavors of Threshold Automata - Archive ouverte HAL Access content directly
Conference Papers Year :

Reachability in Parameterized Systems: All Flavors of Threshold Automata

(1) , (2, 3) , (1)
1
2
3

Abstract

Threshold automata, and the counter systems they define, were introduced as a framework for parameterized model checking of fault-tolerant distributed algorithms. This application domain suggested natural constraints on the automata structure, and a specific form of acceleration, called single-rule acceleration: consecutive occurrences of the same automaton rule are executed as a single transition in the counter system. These accelerated systems have bounded diameter, and can be verified in a complete manner with bounded model checking. We go beyond the original domain, and investigate extensions of threshold automata: non-linear guards, increments and decrements of shared variables, increments of shared variables within loops, etc., and show that the bounded diameter property holds for several extensions. Finally, we put single-rule acceleration in the scope of flat counter automata: although increments in loops may break the bounded diameter property, the corresponding counter automaton is flattable, and reachability can be verified using more permissive forms of acceleration.
Fichier principal
Vignette du fichier
LIPIcs-CONCUR-2018-19.pdf (578.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01871142 , version 1 (10-09-2018)

Identifiers

Cite

Jure Kukovec, Igor Konnov, Josef Widder. Reachability in Parameterized Systems: All Flavors of Threshold Automata. CONCUR 2018 - 29th International Conference on Concurrency Theory, Sep 2018, Beijing, China. ⟨10.4230/LIPIcs.CONCUR.2018.19⟩. ⟨hal-01871142⟩
166 View
93 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More