A Characterization of Distributed ASMs with Partial-Order Runs

DOI10.1007/978-3-030-48077-6_6zbMath1497.68174OpenAlexW3028118381MaRDI QIDQ5040367

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)

Related Items (1)

A Behavioural Theory of Recursive Algorithms

Cites Work

• Concurrent abstract state machines
• Process rewrite systems.
• Abstract State Machines
• Evolving Algebras 1993: Lipari Guide
• A Behavioural Theory of Recursive Algorithms
• Sequential abstract-state machines capture sequential algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Characterization of Distributed ASMs with Partial-Order Runs