Skip to main content

Composing Transitions into Transactions in UML Diagrams

  • Conference paper
Computer Aided Systems Theory – EUROCAST 2005 (EUROCAST 2005)

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

Included in the following conference series:

  • 1247 Accesses

Abstract

When modeling concurrent or parallel systems, we must be aware that basic activities of each system may be constituted by smaller activities, i.e. transitions may be conceptually refined into transactions. Nevertheless, the Unified Modeling Language seems to lack compositional constructs for defining atomic actions/activities/operations. We discuss proper extensions for UML behavioral diagrams that are able to cope with the concept of transaction. Transactions are formally defined through a special morphism between automata in a semantic domain called Nonsequential Automata.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Rumbaugh, J., Jacobson, I., Booch, G.: The Unified Modeling Language Reference Manual, 2nd edn. Addison-Wesley, Reading (2004)

    Google Scholar 

  2. Menezes, P.B., Costa, J.F.: Compositional reification of concurrent systems. Journal of the Brazilian Computer Society 2, 50–67 (1995)

    Google Scholar 

  3. Menezes, P.B., Costa, J.F., Sernadas, A.S.: Refinement mapping for general (discrete event) system theory. In: Albrecht, R., Moreno-Díaz, R., Pichler, F. (eds.) EUROCAST 1995. LNCS, vol. 1030, pp. 103–116. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  4. Meseguer, J., Montanari, U.: Petri nets are monoids. Information and Computation 88, 105–155 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  5. Machado, J.P., Menezes, P.B.: Modeling transactions in uml activity diagrams via nonsequential automata. In: Actas de la XXX Conferencia Latinoamericana de Informatica, CLEI, pp. 543–553 (2004)

    Google Scholar 

  6. OMG: Uml 2.0 superstructure ftf. Technical Report ptc/04-10-02, Object Management Group (2004)

    Google Scholar 

  7. OMG: Uml 2.0 infrastructure final adopted specifcation. Technical Report ptc/03-09-15, Object Management Group (2003)

    Google Scholar 

  8. Reisig, W.: Petri Nets: an introduction. Eatcs Monographs on Theoretical Computer Science, vol. 4. Springer, Heidelberg (1985)

    MATH  Google Scholar 

  9. Gehrke, T., Goltz, U., Wehrheim, H.: The dynamic models of UML: Towards a semantics and its application in the development process. Technical Report 11/98, Institut fur Informatik, Universitat Hildesheim (1998)

    Google Scholar 

  10. Eshuis, R., Wieringa, R.: Comparing petri net and activity diagram variants for workflow modelling - a quest for reactive petri nets. In: Ehrig, H., Reisig, W., Rozenberg, G., Weber, H. (eds.) Petri Net Technology for Communication-Based Systems. LNCS, vol. 2472, pp. 321–351. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Shen, W., Compton, K., Huggins, J.: A validation method for uml model based on abstract state machines. In: Proceedings of EUROCAST, pp. 220–223 (2001)

    Google Scholar 

  12. Knapp, A., Merz, S.: Model checking and code generation for uml state machines and collaborations. In: Proceedings of 5th Workshop on Tools for System Design and Verification, pp. 59–64 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Machado, J.P., Menezes, P.B. (2005). Composing Transitions into Transactions in UML Diagrams. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2005. EUROCAST 2005. Lecture Notes in Computer Science, vol 3643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11556985_9

Download citation

  • DOI: https://doi.org/10.1007/11556985_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29002-5

  • Online ISBN: 978-3-540-31829-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics