An ASM-characterization of a class of distributed algorithms

DOI10.1007/978-3-642-11447-2_4MaRDI QIDQ3400954zbMATH OpenOpenAlexFDO

Authors Andreas Glausch, Wolfgang Reisig

Publication date 28 January 2010

Published in Rigorous Methods for Software Construction and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11447-2_4

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• On Gurevich's theorem on sequential algorithms
• scientific article; zbMATH DE number 2172808
• The computable kernel of abstract state machines
• A characterization of distributed ASMs with partial-order runs
• Concurrent abstract state machines

Cited in

(7)

• A Semantic Characterization of Unbounded-Nondeterministic Abstract State Machines
• Classes of algorithms: formalization and comparison
• A characterization of distributed ASMs with partial-order runs
• Axiomatization and characterization of BSP algorithms
• Distributed Adaptive Systems
• scientific article; zbMATH DE number 1670509 (Why is no real title available?)
• A derivation of distributed implementation of Warshall's algorithm

This page was built for publication: An ASM-characterization of a class of distributed algorithms

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