Nothing Special   »   [go: up one dir, main page]

Skip to main content

Consistent Integration for Sequential Abstract State Machines

  • 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:

  • 401 Accesses

Abstract

In this paper we deal with the problem of integrating components described as Sequential Abstract State Machines. Two operations are defined to compose sequential ASMs and returning a ma hine consistent with respect to updates. Due to their nature, such operations an be used to analyze and handle “behavioral in onsistencies” and to prove omponent and system properties. The applicative aspects of the theoretical issues introduced in the paper are shown by means of three examples: the behavioral description of a telephone system presented in [7],the ASM specification of the Production Cell ase study developed in [3],and the ASM solution of the railroad crossing problem given in [12].

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Ahrendt, W., Baar, T., Beckert, B., Giese, M., Haehnle, R., Menzel, W., Mostowsky, W., Schmitt, P.H., (2002) The KeY System: Integrating Object-Oriented Design and Formal Methods. In Procs.of FASE at ETAPS 02. 339

    Google Scholar 

  2. Blass A., Gurevich Y., (2001) Abstract State Machines Capture Parallel Algo-rithms. ACM Transactions on Computational Logic, to appear, MSR-TR-2001-117.324,328

    Google Scholar 

  3. Boerger, E., Mearelli, L., (1997) Integrating ASMs into the software Development Life Cycle, JUCS vol. 3 n. 5, pp. 603–665. 324,328,331,338

    Google Scholar 

  4. Boerger, E., Riccobene, E., Schmid, J., (2000) Capturing Requirements by Abstract State Machines: The Light Control Case Study JUCS, vol. 6 n. 7, pp. 597–620. 329

    Google Scholar 

  5. Boerger, E., (2002) The Origins and Development of the ASM Method for high level System Design and Analysis JUCS vol. 8 n. 1, pp. 2–74. 324

    Google Scholar 

  6. Boerger, E., Schmid, J., (2000) Composition submachines concepts for sequential ASMs In P. Clote and H. Schwichtenberg, eds. LNCS 1862, pp. 41–60. 325

    Google Scholar 

  7. Easterbrook, S., Nuseibeh, B., (1996) Using ViewPoints for Inconsistency Man-agement BCS/IEE Software Engineering Journal, pp. 31–43, January 1996. 324, 327

    Google Scholar 

  8. Easterbrook, S., Chechik, M., (2000) A Framework for Multi-Valued Reasoning over Inconsistent ViewPoints In Procs.ICSE 2001.

    Google Scholar 

  9. Finkelstein, A.C.W., Goedicke, M., Kramer, J., and Niskier, C., (1989) Viewpoint Oriented Software development: Methods and Viewpoints in Requirements Engineering in Algebraic Methods II:theory,tools and applications,Bergstra, J.A. amp; Feijs, L.M.G. eds (Springer Verlag) 1991, LNCS 490, 29–54. 327

    Google Scholar 

  10. Gurevich, Y., (1995) Evolving Algebras 1993: Lipari Guide in E. Boerger, editor, Specification and Validation Methods, pp. 9–36. Oxford University Press, 1995. 324,325,326

    Google Scholar 

  11. Gurevich, Y., (2000) Sequential Abstract State Machines capture sequential algo-rithms in ACM Transaction on Computational Logic Volume 1 Number 1. 324, 325,326,329,331

    Google Scholar 

  12. Gurevich, Y., (1996) The Railroad Crossing Problem: An Experiment with instan-taneous Actions and Immediate Reactions Proc.CSL’ 95. LNCS 1092, pp. 266–290. 324,328,333

    Google Scholar 

  13. Lewerentz, C., Linder, T. editors (1995) Formal Development of Reactive Systems. A Case Study “Production Cell”. Number 891 in LNCS. 328

    Google Scholar 

  14. Linder, T. (1995). Task description. (891):9–21. 328

    Google Scholar 

  15. Staerk, R.F., Nanchen, S., (2001) A logic for Abstract State Machines JUCS, 7(11):981–1006. 324

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Asmundo, M.N., Riccobene, E. (2003). Consistent Integration for Sequential Abstract State Machines. 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_19

Download citation

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

  • 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