Skip to main content

Using a Triple Graph Grammar for State Machine Implementations

  • Conference paper
  • 804 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5214))

Abstract

State machines can be comprehensively specified, simulated and validated at design time to get a formally founded skeleton for a software application. A direct implementation of state machines in Java source code can realize states as classes, transitions as methods and variables as well as pre-conditions and variable updates as auxilliary methods, invoking either arbitrary application methods to retrieve the current variable values or evaluating expressions [1]. Viewed from an abstract level, implementation and state machine are two models, sharing the same semantics. To maintain the modelled software systems, it is vitally important to perserve as much of this semantics as possible in the source code to be able to track back changes and errors [2,3]. In contrast to these considerations, current techniques of model-driven development use several unidirectional steps, starting from an abstract model and resulting in platfrom specific source code.

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

Buying options

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

Learn about institutional subscriptions

References

  1. Goedicke, M., Balz, M., Striewe, M.: UPPAAL-Modelle als ausführbare Spezifikation in Java. In: Proceedings of Workshop Modellgetriebene Softwarearchitektur - Evolution, Integration und Migration (MSEIM 2008), Munich (2008)

    Google Scholar 

  2. Baker, P., Loh, S., Weil, F.: Model-Driven Engineering in a Large Industrial Context – Motorola Case Study. In: Briand, L., Williams, C. (eds.) MoDELS 2005. LNCS, vol. 3713, pp. 476–491. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Hailpern, B., Tarr, P.: Model-driven development: The good, the bad, and the ugly. IBM Systems Journal 45(3), 451–461 (2006)

    Article  Google Scholar 

  4. Schürr, A.: Specification of graph translators with triple graph grammars. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol. 903. Springer, Heidelberg (1995)

    Google Scholar 

  5. AGG-Team: The AGG website, http://tfs.cs.tu-berlin.de/agg/

  6. Larsen, K.G., Pettersson, P., Yi, W.: Uppaal in a Nutshell. Int. Journal on Software Tools for Technology Transfer 1(1–2), 134–152 (1997)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Striewe, M. (2008). Using a Triple Graph Grammar for State Machine Implementations. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds) Graph Transformations. ICGT 2008. Lecture Notes in Computer Science, vol 5214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87405-8_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87405-8_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87404-1

  • Online ISBN: 978-3-540-87405-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics