Eliminating Message Counters in Threshold Automata

DOI10.1007/978-3-030-59152-6_11MaRDI QIDQ6485868zbMATH OpenFDO

Authors Ilina Stoilkovska, Josef Widder, Florian Zuleger

Publication date 22 December 2022

Published in 1517.68216 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-59152-6_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15)

Recommendations

• Eliminating message counters in synchronous threshold automata
• Complexity of Verification and Synthesis of Threshold Automata
• SMT and POR beat counter abstraction: parameterized model checking of threshold-based distributed algorithms
• Reachability in parameterized systems: all flavors of threshold automata
• \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms

Cited in

(2)

• Eliminating message counters in synchronous threshold automata
• Complexity of Verification and Synthesis of Threshold Automata

This page was built for publication: Eliminating Message Counters in Threshold Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6485868)