Reachability in Parameterized Systems: All Flavors of Threshold Automata

Jure Kukovec 1 Igor Konnov 2 Josef Widder 1
2 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
LORIA - FM - Department of Formal Methods , Inria Nancy - Grand Est, MPII - Max-Planck-Institut für Informatik
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.
Type de document :
Communication dans un congrès
CONCUR 2018 - 29th International Conference on Concurrency Theory, Sep 2018, Beijing, China. 〈10.4230/LIPIcs.CONCUR.2018.19〉
Liste complète des métadonnées

Littérature citée [24 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01871142
Contributeur : Igor Konnov <>
Soumis le : lundi 10 septembre 2018 - 14:05:48
Dernière modification le : mardi 19 février 2019 - 15:40:04
Document(s) archivé(s) le : mardi 11 décembre 2018 - 14:54:34

Fichier

LIPIcs-CONCUR-2018-19.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

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〉

Partager

Métriques

Consultations de la notice

83

Téléchargements de fichiers

31