The expressive power of abstract-state machines

Computing and Informatics

Volumn 22, Issue 3-4, 2003, Pages 209-219

  Reisig, Wolfgang ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Abstract State Machines; Computation models; Expressive power; Sequential algorithms; Specification technique; Transition systems

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; FUNCTIONS; SEMANTICS; SET THEORY; TURING MACHINES;

ABSTRACT-STATE MACHINES; COMPUTATION MODELS; TRANSITION SYSTEMS;

SYSTEMS ANALYSIS;

EID: 0347595156     PISSN: 13359150     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. The ASM web-page: http://eecs.umich.edu/gasm.
2. BÖRGER, E.: High Level System Design and Analysis Using Abstract State Machines. In D. Hutter et al., editor, Current Trends in Applied Formal Methods, Vol. 1464 of LNCS, pp. 1-43, 1999.
3. BÖRGER, E.: The Origin of the ASM Method for High Level System Design and Analysis. Journal of Universal Computer Science, Vol. 8, 2002, No. 1, pp. 2-74.
4. BÖRGER. E.: Stärk, R.: Abstract State Machines - A Method for High-Level System Design and Analysis. Springer Verlag, 2003.
5. GUREVICH, Y.: A New Thesis. American Mathematical Society Abstracts, p. 317, August 1985.
6. GUREVICH, Y.: Evolving Algebra 1993: Lipari Guide. In E. Börger, editor, Specification and Validtion Methods, pp. 9-3, Oxford University Press, 1995.
7. GUREVICH, Y.: Sequential Abstract-State Machines Capture Sequential Algorithms. ACM Transactions on Computational Logic, Vol. 1, 2000, No. 1, pp. 77-111.
8. KNUTH, D. E.: The Art of Computer Programming. Vol. 1: Fundamental Algorithms. Addison-Wesley, 1973.
9. REISIG, W.: On Gurewich's Theorem on Sequential Algorithms. Acta Informatica, Vol. 39, 2003, pp. 273-305.