Extended dependency graphs and efficient distributed fixed-point computation
From MaRDI portal
Publication:1662534
DOI10.1007/978-3-319-57861-3_10zbMath1393.68098OpenAlexW2610810296MaRDI QIDQ1662534
Mads Chr. Olesen, Andreas Engelbredt Dalsgaard, Jiří Srba, Samuel Pastva, Lasse S. Jensen, Peter Fogh, Søren Enevoldsen, Søren M. Nielsen, Tobias S. Jepsen, Isabella Kaufmann, Kim Guldstrand Larsen
Publication date: 20 August 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-57861-3_10
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)
Related Items
On-the-Fly Synthesis for Strictly Alternating Games ⋮ Elimination of detached regions in dependency graph verification ⋮ On the Verification of Weighted Kripke Structures Under Uncertainty ⋮ Model checking and synthesis for branching multi-weighted logics
Uses Software
