Skip to main content
SpringerLink
Log in

Abstract State Processes

  • Conference paper
  • First Online:
Abstract State Machines 2003 (ASM 2003)

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

Included in the following conference series:

Abstract

Process-algebraic languages offer a rich set of structuring techniques and concurrencypa tterns which allow one to decompose complex systems into concurrently interacting simpler component processes. Theyab stract however almost entirely from a notion of system state. The method of Abstract State Machines (ASMs) offers powerful abstraction and refinement techniques for specifying system dynamics based upon a most general notion of structured state. The evolutions of the state are governed however bya fixed and typically unstructured program, called ‘rule’, which describes a set of abstract updates occurring simultaneously at each step (synchronous parallelism). We propose to incorporate into one machine concept the advantages offered byb oth structuring techniques, and introduce to this purpose Abstract State Processes (ASPs), i.e. evolving processes (extended ASM programs which are structured and evolve like process-algebraic behaviour expressions) operating on evolving abstract states the wayt raditional ASM rules do.

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. J.-R. Abrial. The B-Book. Cambridge UniversityPress, 1996. 23

    Google Scholar 

  2. A. Blass and Y. Gurevich. Abstract State Machines capture parallel algorithms. ACM Transactions on Computational Logic, 3, 2002. 23, 24

    Google Scholar 

  3. T. Bolognesi and E. Brinksma. Introduction to the ISO specification language LOTOS. Computer Networks and ISDN Systems, 14(1):25–59, 1987. 23

    Article  Google Scholar 

  4. E. Börger. Whyu se 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. 22

    Google Scholar 

  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. 22

    Chapter  Google Scholar 

  6. E. Börger. The ASM refinement method. Formal Aspects of Computing, 14:?-?, 2002. 30, 31

    Google Scholar 

  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. 22, 30

    Google Scholar 

  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. 23, 24, 26

    Google Scholar 

  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. 23, 24, 25, 26, 30

    Google Scholar 

  10. E. Börger and R. Stärk. Abstract State Machines. A method for high-level system design and analysis. Springer, 2003. 24, 26, 30

    Google Scholar 

  11. J. Derrick and E. Boiten. Refinement in Z and Object-Z. Springer, 2001. 30

    Google Scholar 

  12. L. M. G. Feijs and H. B. M. Jonkers. Formal Specification and Design. Cambridge UniversityPress, 1992. 25

    Google Scholar 

  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 2003, LNCS. Springer-Verlag, 2003. 30

    Google Scholar 

  14. Y. Gurevich. Evolving algebras. A tutorial introduction. Bulletin of EATCS, 43:264–284, 1991. 22, 24

    MATH  Google Scholar 

  15. Y. Gurevich. Evolving Algebras 1993: Lipari Guide. In E. Börger, editor, Specification and Validation Methods, pages 9–36. Oxford UniversityPress, 1995. 24

    Google Scholar 

  16. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985. 24

    Google Scholar 

  17. L. Lamport. Adding “Process Algebra” to TLA. January1995. 31

    Google Scholar 

  18. R. Milner. Communication and Concurrency. Prentice-Hall, 1989. 24

    Google Scholar 

  19. A.W. Roscoe. The Theory and Practice of Concurrency. Prentice-Hall, 1998. 24

    Google Scholar 

  20. S. Schneider. Concurrent and Real-Time Systems: The CSP Approach. Wiley, 2000. 24

    Google Scholar 

  21. R. F. Stärk, J. Schmid, and E. Börger. Java and the Java Virtual Machine: Definition, Verification, Validation. Springer-Verlag, 2001. 23, 24

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNR, ISTI, Pisa

    Tommaso Bolognesi

  2. Dipartimento di Informatica, Università di Pisa, I-56125, Pisa, Italy

    Egon Börger

Authors
  1. Tommaso Bolognesi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Egon Börger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Via Buonarotti 2, 56127, Pisa, Italy

    Egon Börger

  2. CEA, Università di Catania, Piazza Università 2, 95124, Catania, Italy

    Angelo Gargantini

  3. Dipartimento di Matematica e Informatica, Università di Catania, Città Universitaria, viale A. Doria 6, 95125, Catania, Italy

    Elvinia Riccobene

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bolognesi, T., Börger, E. (2003). Abstract State Processes. In: Börger, E., Gargantini, A., Riccobene, E. (eds) Abstract State Machines 2003. ASM 2003. Lecture Notes in Computer Science, vol 2589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36498-6_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-36498-6_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00624-4

  • Online ISBN: 978-3-540-36498-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation