Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blass, A., Gurevich, Y.: Abstract State Machines Capture Parallel Algorithms. ACM Trans. Comput. Logic 4(4), 578–651 (2003)
Blass, A., Gurevich, Y.: Ordinary Interactive Small-Step Algorithms, parts I, II, III. ACM Trans. Comput. Logic (2006)
Blass, A., Gurevich, Y., Rosenzweig, D., Rossman, B.: General Interactive Small Step Algorithms. Technical Report MSR-TR-2005-113, Microsoft Research (August 2006)
Börger, E., Stärk, R.: Abstract State Machines: A Method for High-Level System Design and Analysis. Springer, Heidelberg (2003)
Glausch., A., Reisig, W.: Distributed Abstract State Machines and Their Expressive Power, Humboldt-Universität zu, Berlin. Informatik-Berichte, vol. 196 (2006), http://www.informatik.hu-berlin.de/top/download/publications/GlauschR2006_hub_tr196.pdf
Gurevich, Y.: Evolving Algebras 1993: Lipari Guide. In: Börger, E. (ed.) Specification and Validation Methods, pp. 9–36. Oxford University Press, Oxford (1995)
Gurevich, Y.: Sequential Abstract State Machines Capture Sequential Algorithms. ACM Transactions on Computational Logic 1(1), 77–111 (2000)
Gurevich, Y., Yavorskaya, T.: On Bounded Exploration and Bounded Nondeterminism. Technical Report MSR-TR-2006-07, Microsoft Research (January 2006)
ITU-T. SDL Formal Semantics Definition. ITU-T Recommendation Z.100 Annex F, International Telecommunication Union (November 2000)
Petri, C.A.: Non-Sequential Processes. Interner Bericht ISF–77–5, Gesellschaft für Mathematik und Datenverarbeitung (1977)
Reisig, W.: Petri Nets: An Introduction. Springer-Verlag New York, Inc., New York (1985)
Reisig, W.: On Gurevich’s Theorem on Sequential Algorithms. Acta Informatica 39(5), 273–305 (2003)
Stärk, R., Schmid, J., Börger, E.: Java and the Java Virtual Machine: Definition, Verification, Validation. Springer, Heidelberg (2001)
Pratt, V.: Modeling Concurrency with Partial Orders. Int. J. of Parallel Programming 15(1), 33–71 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Glausch, A., Reisig, W. (2009). An ASM-Characterization of a Class of Distributed Algorithms. In: Abrial, JR., Glässer, U. (eds) Rigorous Methods for Software Construction and Analysis. Lecture Notes in Computer Science, vol 5115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11447-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-11447-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11446-5
Online ISBN: 978-3-642-11447-2
eBook Packages: Computer ScienceComputer Science (R0)