Skip to main content
SpringerLink
Log in

Towards an ASM Thesis for Unconventional Algorithms

  • Conference paper
  • First Online:
Abstract State Machines - Theory and Applications (ASM 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1912))

Included in the following conference series:

  • 406 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hagit Attiya and Jenifer Welch. Distributed Computing. McGraw Hill, 1998.

    Google Scholar 

  2. Jean-Pierre Banâtre and Daniel Le Métayer. Programming by multiset transfor-m mation. CACM, 36(1):98–111, 1993.

    Article  Google Scholar 

  3. Eike Best and Cesar Fernandez. Nonsequential Processes. Springer-Verlag, 1988.

    Google Scholar 

  4. W. P. de Roever et al. Concurrency verification: Introduction to compositional and noncompositional proof methods. to appear 2000.

    Google Scholar 

  5. U. Goltz and W. Reisig. The non-sequential behaviour of Petri nets. Information and Control, 57(2-3):125–147, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  6. Yuri Gurevich. Evolving algebras-a tutorial introduction. Bulletin of the EATCS, (43):264–284, 1991.

    MATH  Google Scholar 

  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. Yuri Gurevich. The sequential asm thesis. Bulletin of the EATCS 67, pages 93–124, 1999.

    Google Scholar 

  9. Anatol Holt. Introduction to occurrence systems. In Associative Information Techniques, pages 175–203. American Elsevir, New York, 1971.

    Google Scholar 

  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. Ekkart Kindler and Rolf Walter. Mutex needs fairness. Information Processing Letters 62, pages 31–39, 1997.

    Google Scholar 

  12. Leslie Lamport. Time,clocks, and the ordering of events in a distributed system. CACM, 21(7):558–565, 1978.

    Article  MATH  Google Scholar 

  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. Leslie Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872–923, 1994.

    Article  Google Scholar 

  15. Nancy Lynch. Distributed Algorithms. Kaufman, Morgan, Los Altos, CA, 1996.

    Google Scholar 

  16. Zohar Manna and Amir Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, Berlin, 1992.

    Google Scholar 

  17. Robin Milner. Elements of interaction. CACM, 36:78–89, 1993.

    Article  Google Scholar 

  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. 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. Wolfgang Reisig. Elements of Distributed Algorithms. Springer-Verlag, 1998.

    Google Scholar 

  21. Peter Wegner. Interactive foundations of computing. Theoretical Computer Science, 192:315–351, 1998.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Humboldt-Universität zu Berlin, Berlin, Germany

    Wolfgang Reisig

Authors
  1. Wolfgang Reisig
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA

    Yuri Gurevich

  2. ETH Zürich, Institute TIK Gloriastr., 35, 8092, Zürich, Switzerland

    Philipp W. Kutter

  3. EPFL Lausanne, DI IN-Ecublens, 1015, Lausanne, Switzerland

    Martin Odersky

  4. ETH Zürich, Institute TIK Gloriastr., 35, 8092, Zürich, Switzerland

    Lothar Thiele

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reisig, W. (2000). Towards an ASM Thesis for Unconventional Algorithms. In: Gurevich, Y., Kutter, P.W., Odersky, M., Thiele, L. (eds) Abstract State Machines - Theory and Applications. ASM 2000. Lecture Notes in Computer Science, vol 1912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44518-8_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-44518-8_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67959-2

  • Online ISBN: 978-3-540-44518-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation