Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction

DOI10.1007/978-3-319-73721-8_1zbMath1446.68086OpenAlexW2779460099MaRDI QIDQ3296318

Florian Zuleger, Ilina Stoilkovska, Sasha Rubin, Benjamin Aminof, Josef Widder

Publication date: 7 July 2020

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

Full work available at URL: http://resolver.obvsg.at/urn:nbn:at:at-ubtuw:3-3417

Mathematics Subject Classification ID

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

Related Items (5)

Verification of agent navigation in partially-known environments ⋮ Eliminating message counters in synchronous threshold automata ⋮ Reachability in Parameterized Systems: All Flavors of Threshold Automata ⋮ Parameterized model checking of networks of timed automata with Boolean guards ⋮ Characterizing Consensus in the Heard-Of Model

This page was built for publication: Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction