Abstract state processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2589, Issue , 2003, Pages 22-32

  Bolognesi, Tommaso ^a   Börger, Egon ^b  

^a ISTI CNR   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

ABSTRACT STATE MACHINES; ALGEBRAIC LANGUAGES; ONE-MACHINE; REFINEMENT TECHNIQUES; STATE PROCESS; SYSTEM DYNAMICS; SYSTEM STATE; UNSTRUCTURED PROGRAMS;

ALGEBRA;

EID: 21144452941     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36498-6_2     Document Type: Article

References (21)

1. J.-R. Abrial. The B-Book. Cambridge University Press, 1996.
2. A. Blass and Y. Gurevich. Abstract State Machines capture parallel algorithms. ACM Transactions on Computational Logic, 3, 2002.
3. T. Bolognesi and E. Brinksma. Introduction to the ISO specification language LOTOS. Computer Networks and ISDN Systems, 14(1):25-59, 1987.
4. E. Börger. Why use evolving algebras for hardware and software engineering? In M. Bartosek, J. Staudek, and J. Wiederman, editors, Proceedings of SOFSEM'95, 22nd Seminar on Current Trends in Theory and Practice of Informatics, volume 1012 of LNCS, pages 236-271. Springer-Verlag, 1995.
5. E. Börger. High level system design and analysis using Abstract State Machines. In D. Hutter, W. Stephan, P. Traverso, and M. Ullmann, editors, Current Trends in Applied Formal Methods (FM-Trends 98), number 1641 in LNCS, pages 1-43. Springer-Verlag, 1999.
6. E. Börger. The ASM refinement method. Formal Aspects of Computing, 14:?-?, 2002.
7. E. Börger. The origins and the development of the ASM method for high level system design and analysis. J. of Universal Computer Science, 8(1):2-74, 2002.
8. E. Börger and T. Bolognesi. Remarks on turbo ASMs for computing functional equations and recursion schemes. In E. Börger, A. Gargantini, and E. Riccobene, editors, Abstract State Machines 2003, LNCS. Springer-Verlag, 2003.
9. E. Börger and J. Schmid. Composition and submachine concepts for sequential ASMs. In P. Clote and H. Schwichtenberg, editors, Computer Science Logic (Proceedings of CSL 2000), volume 1862 of LNCS, pages 41-60. Springer-Verlag, 2000.
10. E. Börger and R. Stärk. Abstract State Machines. A method for high-level system design and analysis. Springer, 2003.
11. J. Derrick and E. Boiten. Refinement in Z and Object-Z. Springer, 2001.
12. L. M. G. Feijs and H. B. M. Jonkers. Formal Specification and Design. Cambridge University Press, 1992.
13. N. G. Fruja and R. F. Stärk. The hidden computation steps of turbo Abstract State Machines. In E. Börger, A. Gargantini, and E. Riccobene, editors, Abstract State Machines 2005, LNCS. Springer-Verlag, 2003.
14. Y. Gurevich. Evolving algebras. A tutorial introduction. Bulletin of EATCS, 43:264-284, 1991.
15. Y. Gurevich. Evolving Algebras 1993: Lipari Guide. In E. Börger, editor, Specification and Validation Methods, pages 9-36. Oxford University Press, 1995.
16. C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
17. L. Lamport. Adding "Process Algebra" to TLA. January 1995.
18. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
19. A. W. Roscoe. The Theory and Practice of Concurrency. Prentice-Hall, 1998.
20. S. Schneider. Concurrent and Real-Time Systems: The CSP Approach. Wiley, 2000.
21. R. F. Stärk, J. Schmid, and E. Börger. Java and the Java Virtual Machine: Definition, Verification, Validation. Springer-Verlag, 2001.