2026-08-16T20:14:58Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9557 2024-03-06T10:44:43Z ddc:004 open_access

Reachability in Parameterized Systems: All Flavors of Threshold Automata Kukovec, Jure Konnov, Igor Widder, Josef threshold & counter automata parameterized verification reachability 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jure Kukovec and Igor Konnov and Josef Widder 2018 Is Part Of LIPIcs, Volume 118, 29th International Conference on Concurrency Theory (CONCUR 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CONCUR.2018.19 urn:nbn:de:0030-drops-95578 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.19 eng https://creativecommons.org/licenses/by/3.0/legalcode