Towards an ASM Thesis for Unconventional Algorithms

  • Wolfgang Reisig
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1912)


All descriptions of algorithms, be they formal or informal, employ data structures, operations on them, and some policy to cause operations be applied to data. Gurevich calls a formal description technique for algorithms algorithm universal if it allows for each informally described algorithm a formal representation that would essentially make precise the notions used in the informal description, not employing additional data, operations or steps. Gurevich’s ASM thesis claims Abstract State Machines be algorithm universal for conventional, sequential algorithms. Here we are behind properties of formal presentations that are algorithm universal for unconventional, distributed algorithms.


Algorithmic Idea Conventional Algorithm Liberal Policy Algorithm Algorithm Glue Glue 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hagit Attiya and Jenifer Welch. Distributed Computing. McGraw Hill, 1998.Google Scholar
  2. 2.
    Jean-Pierre Banâtre and Daniel Le Métayer. Programming by multiset transfor-m mation. CACM, 36(1):98–111, 1993.CrossRefGoogle Scholar
  3. 3.
    Eike Best and Cesar Fernandez. Nonsequential Processes. Springer-Verlag, 1988.Google Scholar
  4. 4.
    W. P. de Roever et al. Concurrency verification: Introduction to compositional and noncompositional proof methods. to appear 2000.Google Scholar
  5. 5.
    U. Goltz and W. Reisig. The non-sequential behaviour of Petri nets. Information and Control, 57(2-3):125–147, 1983.MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Yuri Gurevich. Evolving algebras-a tutorial introduction. Bulletin of the EATCS, (43):264–284, 1991.zbMATHGoogle Scholar
  7. 7.
    Yuri Gurevich. Evolving algebras 1993: Lipari guide. In E. Börger, editor, Specification and Validation Methods, pages 9–36. Oxford University Press, 1995.Google Scholar
  8. 8.
    Yuri Gurevich. The sequential asm thesis. Bulletin of the EATCS 67, pages 93–124, 1999.Google Scholar
  9. 9.
    Anatol Holt. Introduction to occurrence systems. In Associative Information Techniques, pages 175–203. American Elsevir, New York, 1971.Google Scholar
  10. 10.
    Anatol Holt, H. Saint, R. Shapiro, and S. Warshall. Final report on the information systems theory project. Technical Report RADC-TR-68-305, Rome Air Developement Center, Griffis Air Force Base, New York, 1968. Distributed by Clearinghouse for Scientific and Technical Information, US Department of Commerce, 352 pages.Google Scholar
  11. 11.
    Ekkart Kindler and Rolf Walter. Mutex needs fairness. Information Processing Letters 62, pages 31–39, 1997.Google Scholar
  12. 12.
    Leslie Lamport. Time,clocks, and the ordering of events in a distributed system. CACM, 21(7):558–565, 1978.CrossRefzbMATHGoogle Scholar
  13. 13.
    Leslie Lamport. Solved problems, unsolved problems and non-problems in concurrency. In Proceedings of the 3rd Symposium on Principles of Distributed Computing, 1983, pages 34–44, 1984.Google Scholar
  14. 14.
    Leslie Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872–923, 1994.CrossRefGoogle Scholar
  15. 15.
    Nancy Lynch. Distributed Algorithms. Kaufman, Morgan, Los Altos, CA, 1996.Google Scholar
  16. 16.
    Zohar Manna and Amir Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, Berlin, 1992.Google Scholar
  17. 17.
    Robin Milner. Elements of interaction. CACM, 36:78–89, 1993.CrossRefGoogle Scholar
  18. 18.
    C.A. Petri. Non-sequential processes. Technical Report Internal Report, GMD-ISF-77-5, Gesellschaft für Mathematik und Datenverarbeitung, Bonn(Germany), 1977.Google Scholar
  19. 19.
    Vaugham Pratt (ed.). Debate’ 90: An electronic discussion on true concurrency. In Peled, Pratt, and Holzmann, editors, Partial Order Methods in Verification, volume 29 of DIMACS Series, pages 359–403. 1997.Google Scholar
  20. 20.
    Wolfgang Reisig. Elements of Distributed Algorithms. Springer-Verlag, 1998.Google Scholar
  21. 21.
    Peter Wegner. Interactive foundations of computing. Theoretical Computer Science, 192:315–351, 1998.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Wolfgang Reisig
    • 1
  1. 1.Humboldt-Universität zu BerlinBerlinGermany

Personalised recommendations