Concurrent abstract state machines

DOI10.1007/S00236-015-0249-7zbMath1352.68176DBLPjournals/acta/BorgerS16OpenAlexW2205449728WikidataQ59470221 ScholiaQ59470221MaRDI QIDQ303691

Klaus-Dieter Schewe, Egon Börger

Publication date: 22 August 2016

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-015-0249-7

zbMATH Keywords

abstract state machine (ASM)concurrent ASM rundistributed ASM runPetri net runsequentially consistent ASM run

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (9)

Distributed Adaptive Systems ⋮ Capturing Membrane Computing by ASMs ⋮ A Characterization of Distributed ASMs with Partial-Order Runs ⋮ A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis ⋮ Axiomatization and characterization of BSP algorithms ⋮ A unifying logic for non-deterministic, parallel and concurrent abstract state machines ⋮ A Behavioural Theory of Recursive Algorithms ⋮ What is the natural abstraction level of an algorithm? ⋮ Computation on structures. Behavioural theory, logic, complexity

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis
• Partial updates
• The ASM refinement method
• On interprocess communication. I: Basic formalism
• A calculus of communicating systems
• System modelling with high-level Petri nets
• Parallel program schemata
• Construction and analysis of ground models and their refinements as a foundation for validating computer-based systems
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Time, clocks, and the ordering of events in a distributed system
• The B-Book
• Abstract State Machines
• A new solution of Dijkstra's concurrent programming problem
• Evolving Algebras 1993: Lipari Guide
• Abstract state machines capture parallel algorithms
• Ordinary interactive small-step algorithms, I
• Ordinary interactive small-step algorithms, II
• Ordinary interactive small-step algorithms, III
• Abstract state machines capture parallel algorithms
• Interactive Small-Step Algorithms I: Axiomatization
• Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
• Sequential abstract-state machines capture sequential algorithms

This page was built for publication: Concurrent abstract state machines