License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2018.19
URN: urn:nbn:de:0030-drops-95578
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9557/
Go to the corresponding LIPIcs Volume Portal

Kukovec, Jure ; Konnov, Igor ; Widder, Josef

Reachability in Parameterized Systems: All Flavors of Threshold Automata

pdf-format:
LIPIcs-CONCUR-2018-19.pdf (0.6 MB)

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.

BibTeX - Entry

@InProceedings{kukovec_et_al:LIPIcs:2018:9557,
  author =	{Jure Kukovec and Igor Konnov and Josef Widder},
  title =	{{Reachability in Parameterized Systems: All Flavors of Threshold Automata}},
  booktitle =	{29th International Conference on Concurrency Theory  (CONCUR 2018)},
  pages =	{19:1--19:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-087-3},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{118},
  editor =	{Sven Schewe and Lijun Zhang},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9557},
  URN =		{urn:nbn:de:0030-drops-95578},
  doi =		{10.4230/LIPIcs.CONCUR.2018.19},
  annote =	{Keywords: threshold & counter automata, parameterized verification, reachability}
}

Keywords: threshold & counter automata, parameterized verification, reachability
Collection: 29th International Conference on Concurrency Theory (CONCUR 2018)
Issue Date: 2018
Date of publication: 31.08.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI