A characterization of distributed ASMs with partial-order runs

DOI10.1007/978-3-030-48077-6_6zbMATH Open1497.68174OpenAlexW3028118381MaRDI QIDQ5040367FDOQ5040367

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

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

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)

Cites Work

• Abstract State Machines
• Evolving Algebras 1993: Lipari Guide
• Concurrent abstract state machines
• Title not available (Why is that?)
• Sequential abstract-state machines capture sequential algorithms
• Process rewrite systems.
• Title not available (Why is that?)
• Title not available (Why is that?)
• A behavioural theory of recursive algorithms
• Title not available (Why is that?)

Cited In (4)

• An ASM-characterization of a class of distributed algorithms
• A behavioural theory of recursive algorithms
• Partial order techniques for distributed discrete event systems: why you cannot avoid using them
• Title not available (Why is that?)

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)