Coefficient synthesis for threshold automata

DOI10.1007/978-3-031-19135-0_9arXiv2304.08917OpenAlexW4312753037MaRDI QIDQ6173107

A. R. Balasubramanian

Publication date: 21 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2304.08917

zbMATH Keywords

threshold automatacoefficient synthesisPresburger arithmetic with divisibility

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
• Synthesis of distributed algorithms with parameterized threshold guards
• Parameterized Verification of Ad Hoc Networks
• Reasoning about systems with many processes
• Reachability in Parameterized Systems: All Flavors of Threshold Automata
• Parametric real-time reasoning
• A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms

This page was built for publication: Coefficient synthesis for threshold automata