A characterization of distributed ASMs with partial-order runs

DOI10.1007/978-3-030-48077-6_6MaRDI QIDQ5040367zbMATH OpenOpenAlexFDO

Authors Egon Börger, Klaus-Dieter Schewe

Publication date 14 October 2022

Published in Rigorous State-Based Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-48077-6_6

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Classical models of computation (Turing machines, etc.) (68Q04)

Recommendations

• An ASM-characterization of a class of distributed algorithms
• scientific article; zbMATH DE number 1670510
• Concurrent abstract state machines
• scientific article; zbMATH DE number 1860674
• On Gurevich's theorem on sequential algorithms

Cites work

• scientific article; zbMATH DE number 1687041 (Why is no real title available?)
• scientific article; zbMATH DE number 1820018 (Why is no real title available?)
• scientific article; zbMATH DE number 1951182 (Why is no real title available?)
• scientific article; zbMATH DE number 1543042 (Why is no real title available?)
• A behavioural theory of recursive algorithms
• Abstract State Machines
• Concurrent abstract state machines
• Evolving Algebras 1993: Lipari Guide
• Process rewrite systems.
• Sequential abstract-state machines capture sequential algorithms

Cited in

(4)

• An ASM-characterization of a class of distributed algorithms
• Partial order techniques for distributed discrete event systems: why you cannot avoid using them
• scientific article; zbMATH DE number 1670510 (Why is no real title available?)
• A behavioural theory of recursive algorithms

This page was built for publication: A characterization of distributed ASMs with partial-order runs

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