Reachability in distributed memory automata

DOI10.4230/LIPICS.CSL.2021.13MaRDI QIDQ6839827zbMATH OpenFDO

Authors Benedikt Bollig, Fedor Ryabinin, Arnaud Sangnier

Publication date 23 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.CSL.2021.13

zbMATH Keywords

atomic snapshot objectsdistributed algorithmsreachabilityregister automata

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• An automata-theoretic approach to the verification of distributed algorithms
• Decidability of parameterized verification
• Distributed algorithms. An intuitive approach
• Finite-memory automata
• Fresh-register automata
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• Identifiers in registers. Describing network algorithms with logic
• Keeping a crowd safe: on the complexity of parameterized verification (invited talk)
• LTL with the freeze quantifier and register automata
• On Notions of Regularity for Data Languages
• The renaming problem in shared memory systems: an introduction
• Two-variable logic on data words

This page was built for publication: Reachability in distributed memory automata

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