Partially ordered runs: A case study

DOI10.1007/3-540-44518-8_9MaRDI QIDQ2753706zbMATH OpenFDO

Authors Dean Rosenzweig, Yuri Gurevich

Publication date 11 November 2001

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

Full work available at URL https://doi.org/10.1007/3-540-44518-8_9

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• A characterization of distributed ASMs with partial-order runs
• scientific article; zbMATH DE number 2084333
• Proving partial order liveness properties
• Abstract state machines capture parallel algorithms: correction and extension
• Concurrent abstract state machines

Cited in

(4)

• Concurrent abstract state machines
• A characterization of distributed ASMs with partial-order runs
• (D T , C)-Optimal Run Orders
• Logical classification of distributed algorithms (Bakery algorithms as an example)

This page was built for publication: Partially ordered runs: A case study

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