Copertina

Parameterized Verification of Round-based Distributed Algorithms via Extended Threshold Automata

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Baumeister, Tom, Eichler, Paul, Jacobs, Swen, Sakr, Mouhammad, Völp, Marcus
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Distributed, Parallel, and Cluster Computing
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

TACO: A Toolsuite for the Verification of Threshold Automata
di: Eichler, Paul, et al.
Pubblicazione: (2026)

Complexity of Verification and Synthesis of Threshold Automata
di: Balasubramanian, A. R., et al.
Pubblicazione: (2020)

Coefficient Synthesis for Threshold Automata
di: Balasubramanian, A. R.
Pubblicazione: (2023)

Tolerating Disasters with Hierarchical Consensus
di: Yahyaoui, Wassim, et al.
Pubblicazione: (2025)

Parameterized Task Graph Scheduling Algorithm for Comparing Algorithmic Components
di: Coleman, Jared, et al.
Pubblicazione: (2024)

Communication Round and Computation Efficient Exclusive Prefix-Sums Algorithms (for MPI_Exscan)
di: Träff, Jesper Larsson
Pubblicazione: (2025)

Error-resilient Distributed Local Verification
di: Garncarek, Paweł, et al.
Pubblicazione: (2026)

Knowledge Connectivity Requirements for Solving BFT Consensus with Unknown Participants and Fault Threshold (Extended Version)
di: Heydari, Hasan, et al.
Pubblicazione: (2024)

Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits
di: Almalki, Nada, et al.
Pubblicazione: (2025)

On the Universality of Round Elimination Fixed Points
di: Balliu, Alkida, et al.
Pubblicazione: (2025)

CAT: Cellular Automata on Tensor cores
di: Navarro, Cristóbal A., et al.
Pubblicazione: (2024)

Barycentric Coded Distributed Computing with Flexible Recovery Threshold for Collaborative Mobile Edge Computing
di: Qiu, Houming, et al.
Pubblicazione: (2025)

Asynchronous Fault-Tolerant Language Decidability for Runtime Verification of Distributed Systems
di: Castañeda, Armando, et al.
Pubblicazione: (2025)

Distributed Santa Claus via Global Rounding
di: de Vos, Tijn, et al.
Pubblicazione: (2026)

Distributed Algorithms for Potential Problems
di: Balliu, Alkida, et al.
Pubblicazione: (2025)

Formal Verification of a Generic Algorithm for TDM Communication Over Inter Satellite Links
di: Popovic, Miroslav, et al.
Pubblicazione: (2025)

Oblivious Robots Under Round Robin: Gathering on Rings
di: Navarra, Alfredo, et al.
Pubblicazione: (2025)

PULSE: Accelerating Distributed Pointer-Traversals on Disaggregated Memory (Extended Version)
di: Tang, Yupeng, et al.
Pubblicazione: (2023)

Distributed Genetic Algorithm for Feature Selection
di: Potter, Michael, et al.
Pubblicazione: (2024)

Analysis of Distributed Algorithms for Big-data
di: Purohit, Rajendra, et al.
Pubblicazione: (2024)

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs
di: Fuchs, Marc, et al.
Pubblicazione: (2025)

Round-optimal $n$-Block Broadcast Schedules in Logarithmic Time
di: Träff, Jesper Larsson
Pubblicazione: (2023)

Distributed Ranges: A Model for Distributed Data Structures, Algorithms, and Views
di: Brock, Benjamin, et al.
Pubblicazione: (2024)

Tracing Distributed Algorithms Using Replay Clocks
di: Lagwankar, Ishaan
Pubblicazione: (2024)

DAG-based Consensus with Asymmetric Trust [Extended Version]
di: Amores-Sesar, Ignacio, et al.
Pubblicazione: (2025)

An Asynchronous Many-Task Algorithm for Unstructured $S_{N}$ Transport on Shared Memory Systems
di: Elwood, Alex, et al.
Pubblicazione: (2025)

A Survey of Distributed Graph Algorithms on Massive Graphs
di: Meng, Lingkai, et al.
Pubblicazione: (2024)

A Seesaw Model Attack Algorithm for Distributed Learning
di: Yang, Kun, et al.
Pubblicazione: (2024)

Survey on Token-Based Distributed MutualExclusion Algorithms
di: Tohidi, Elahe, et al.
Pubblicazione: (2025)

Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model
di: Barenboim, Leonid, et al.
Pubblicazione: (2023)

Proof-Carrying Fair Ordering: Asymmetric Verification for BFT via Incremental Graphs
di: Ren, Pengkun, et al.
Pubblicazione: (2025)

Extending Contract Verification for Parallel Programming Models to Fortran
di: Oraji, Yussur Mustafa, et al.
Pubblicazione: (2026)

Gathering in Vertex- and Edge-Transitive Graphs without Multiplicity Detection under Round Robin
di: Cicerone, Serafino, et al.
Pubblicazione: (2025)

StarDist: A Code Generator for Distributed Graph Algorithms
di: Nandy, Barenya Kumar, et al.
Pubblicazione: (2025)

An Initial Evaluation of Distributed Graph Algorithms using NWGraph and HPX
di: Mohammadiporshokooh, Karame, et al.
Pubblicazione: (2026)

Analysis of Distributed Average Consensus Algorithms for Robust IoT networks
di: Dhuli, Sateeshkrishna, et al.
Pubblicazione: (2021)

Comparative Analysis of Distributed Caching Algorithms: Performance Metrics and Implementation Considerations
di: Mayer, Helen, et al.
Pubblicazione: (2025)

Efficient Multi-Worker Selection based Distributed Swarm Learning via Analog Aggregation
di: Yao, Zhuoyu, et al.
Pubblicazione: (2025)

Tight Bounds on Channel Reliability via Generalized Quorum Systems (Extended Version)
di: Naser-Pastoriza, Alejandro, et al.
Pubblicazione: (2025)

Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security
di: Chen, Jinyuan
Pubblicazione: (2025)