Complexity of Verification and Synthesis of Threshold Automata

DOI10.1007/978-3-030-59152-6_8MaRDI QIDQ6485862zbMATH OpenFDO

Authors A. R. Balasubramanian, Javier Esparza, Marijana Lazić

Publication date 22 December 2022

Published in 1517.68221 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Logic in computer science (03B70) Analysis of algorithms and problem complexity (68Q25) 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
• Reachability in parameterized systems: all flavors of threshold automata
• Eliminating Message Counters in Threshold Automata
• Synthesis of distributed algorithms with parameterized threshold guards
• \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms

Cited in

(7)

• Checking simple properties of transition systems defined by Thue specifications
• Eliminating message counters in synchronous threshold automata
• Synthesis of distributed algorithms with parameterized threshold guards
• Reachability in parameterized systems: all flavors of threshold automata
• scientific article; zbMATH DE number 7577577 (Why is no real title available?)
• Verification of threshold-based distributed algorithms by decomposition to decidable logics
• Eliminating Message Counters in Threshold Automata

This page was built for publication: Complexity of Verification and Synthesis of Threshold Automata

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