Petri nets: an introduction
Modeling concurrency with partial orders
International Journal of Parallel Programming
Evolving algebras 1993: Lipari guide
Specification and validation methods
Sequential abstract-state machines capture sequential algorithms
ACM Transactions on Computational Logic (TOCL)
Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom
Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom
Abstract State Machines: A Method for High-Level System Design and Analysis
Abstract State Machines: A Method for High-Level System Design and Analysis
Abstract state machines capture parallel algorithms
ACM Transactions on Computational Logic (TOCL)
Ordinary interactive small-step algorithms, I
ACM Transactions on Computational Logic (TOCL)
Persistent queries in the behavioral theory of algorithms
ACM Transactions on Computational Logic (TOCL)
Relativity and abstract state machines
SAM'12 Proceedings of the 7th international conference on System Analysis and Modeling: theory and practice
| Hi-index | 0.00 |
Conventional computation models restrict to particular data structures to represent states of a computation, e.g. natural numbers, sequences, stacks, etc. Gurevich's Abstract State Machines (ASMs) take a more liberal position: any first-order structure may serve as a state. In [7] Gurevich characterizes the expressive power of sequential ASMs: he defines the class of sequential algorithms by means of only a few, amazingly general requirements and proves this class to be equivalent to sequential ASMs. In this paper we generalize Gurevich's result to distributed algorithms: we define a class of distributed algorithms by likewise general requirements and show that this class is covered by a distributed computation model based on sequential ASMs.