Article

Complexity of Verification and Synthesis of Threshold Automata

Authors:

A. R. Balasubramanian,

Javier Esparza,

Marijana LazićAuthors Info & Claims

Automated Technology for Verification and Analysis: 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings

Pages 144 - 160

https://doi.org/10.1007/978-3-030-59152-6_8

Published: 19 October 2020 Publication History

Abstract

Threshold automata are a formalism for modeling and analyzing fault-tolerant distributed algorithms, recently introduced by Konnov, Veith, and Widder, describing protocols executed by a fixed but arbitrary number of processes. We conduct the first systematic study of the complexity of verification and synthesis problems for threshold automata. We prove that the coverability, reachability, safety, and liveness problems are NP-complete, and that the bounded synthesis problem is complete. A key to our results is a novel characterization of the reachability relation of a threshold automaton as an existential Presburger formula. The characterization also leads to novel verification and synthesis algorithms. We report on an implementation, and provide experimental results.

References

[1]

Bloem R et al. Decidability of Parameterized Verification. Synthesis Lectures on Distributed Computing Theory 2015 San Rafael Morgan & Claypool Publishers

[2]

Blondin, M., Haase, C., Mazowiecki, F.: Affine extensions of integer vector addition systems with states. In: CONCUR. LIPIcs, vol. 118, pp. 14:1–14:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)

[3]

Bracha G and Toueg SAsynchronous consensus and broadcast protocolsJ. ACM1985324824-840810339

[4]

Brasileiro F, Greve F, Mostefaoui A, and Raynal M Malyshkin V Consensus in one communication step Parallel Computing Technologies 2001 Heidelberg Springer 42-50

[5]

Chandra TD and Toueg SUnreliable failure detectors for reliable distributed systemsJ. ACM1996432225-2671408322

[6]

Dobre, D., Suri, N.: One-step consensus with zero-degradation. In: DSN, pp. 137–146 (2006)

[7]

Dufourd C, Finkel A, and Schnoebelen P Larsen KG, Skyum S, and Winskel G Reset nets between decidability and undecidability Automata, Languages and Programming 1998 Heidelberg Springer 103-115

[8]

Esparza J Reisig W and Rozenberg G Decidability and complexity of Petri net problems—An introduction Lectures on Petri Nets I: Basic Models 1998 Heidelberg Springer 374-428

[9]

Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: LICS, pp. 352–359. IEEE Computer Society (1999)

[10]

Esparza J and Nielsen MDecidability issues for petri nets - a surveyBull. EATCS199452244-2620838.68082

[11]

German SM and Sistla APReasoning about systems with many processesJ. ACM1992393675-7351177959

[12]

Guerraoui R Non-blocking atomic commit in asynchronous distributed systems with failure detectors Distrib. Comput. 2002 15 1 17-25

[13]

Haase C A survival guide to Presburger arithmetic ACM SIGLOG News 2018 5 3 67-82

[14]

Konnov I, Lazic M, Veith H, and Widder J Para: parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms Formal Methods Syst. Des. 2017 51 2 270-307

[15]

Konnov I, Veith H, and Widder J Baldan P and Gorla D On the completeness of bounded model checking for threshold-based distributed algorithms: reachability CONCUR 2014 – Concurrency Theory 2014 Heidelberg Springer 125-140

[16]

Konnov I, Veith H, and Widder JOn the completeness of bounded model checking for threshold-based distributed algorithms: reachabilityInf. Comput.201725295-1093583732

[17]

Konnov I and Widder J Margaria T and Steffen B ByMC: Byzantine model checker Leveraging Applications of Formal Methods, Verification and Validation. Distributed Systems 2018 Cham Springer 327-342

[18]

Konnov, I.V., Lazic, M., Veith, H., Widder, J.: A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms. In: POPL 2017, pp. 719–734 (2017)

[19]

Kukovec, J., Konnov, I., Widder, J.: Reachability in parameterized systems: all flavors of threshold automata. In: CONCUR, pp. 19:1–19:17 (2018)

[20]

Ladner RE The circuit value problem is log space complete for p SIGACT News 1975 7 1 18-20

[21]

Lazić, M., Konnov, I., Widder, J., Bloem, R.: Synthesis of distributed algorithms with parameterized threshold guards. In: OPODIS. LIPIcs, vol. 95, pp. 32:1–32:20 (2017)

[22]

Mostéfaoui, A., Mourgaya, E., Parvédy, P.R., Raynal, M.: Evaluating the condition-based approach to solve consensus. In: DSN, pp. 541–550 (2003)

[23]

Raynal, M.: A case study of agreement problems in distributed systems: non-blocking atomic commitment. In: HASE, pp. 209–214 (1997)

[24]

Schmitz, S., Schnoebelen, P.: The power of well-structured systems. CoRR abs/1402.2908 (2014)

[25]

Song YJ and van Renesse R Taubenfeld G Bosco: one-step Byzantine asynchronous consensus Distributed Computing 2008 Heidelberg Springer 438-450

[26]

Srikanth T and Toueg S Simulating authenticated broadcasts to derive simple fault-tolerant algorithms Distrib. Comput. 1987 2 80-94

Cited By

Baumeister TEichler PJacobs SSakr MVölp M(2024)Parameterized Verification of Round-Based Distributed Algorithms via Extended Threshold AutomataFormal Methods10.1007/978-3-031-71162-6_33(638-657)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71162-6_33
Balasubramanian A(2022)Coefficient Synthesis for Threshold AutomataReachability Problems10.1007/978-3-031-19135-0_9(125-139)Online publication date: 17-Oct-2022
https://dl.acm.org/doi/10.1007/978-3-031-19135-0_9

Index Terms

Complexity of Verification and Synthesis of Threshold Automata

Index terms have been assigned to the content through auto-classification.

Recommendations

Coefficient Synthesis for Threshold Automata
Reachability Problems
Abstract
Threshold automata are a formalism for modeling fault-tolerant distributed algorithms. The main feature of threshold automata is the notion of a threshold guard, which allows us to compare the number of received messages with the total number of ...
Descriptional complexity of limited automata

A k-limited automaton is a linear bounded automaton that may rewrite each tape cell only in the first k visits, where k0 is a fixed constant. It is known that these automata accept context-free languages only. We investigate the descriptional complexity ...
Descriptional complexity of unambiguous input-driven pushdown automata

It is known that a nondeterministic input-driven pushdown automaton (IDPDA) (a.k.a. visibly pushdown automaton; a.k.a. nested word automaton) with n states can be transformed to an equivalent deterministic automaton with 2 ( n 2 ) states (B. von ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

Automated Technology for Verification and Analysis: 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings

Oct 2020

574 pages

ISBN:978-3-030-59151-9

DOI:10.1007/978-3-030-59152-6

Editors:
Dang Van Hung
Vietnam National University (VNU-UET), Hanoi, Vietnam
,
Oleg Sokolsky
University of Pennsylvania, Philadelphia, PA, USA

© Springer Nature Switzerland AG 2020.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 19 October 2020

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Baumeister TEichler PJacobs SSakr MVölp M(2024)Parameterized Verification of Round-Based Distributed Algorithms via Extended Threshold AutomataFormal Methods10.1007/978-3-031-71162-6_33(638-657)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71162-6_33
Balasubramanian A(2022)Coefficient Synthesis for Threshold AutomataReachability Problems10.1007/978-3-031-19135-0_9(125-139)Online publication date: 17-Oct-2022
https://dl.acm.org/doi/10.1007/978-3-031-19135-0_9

View Options

View options

Figures

Tables

Media

View Table of Conten