[go: up one dir, main page]

Skip to main content

Task Model Refinement with Meta Operators

  • Conference paper
Interactive Systems. Design, Specification, and Verification (DSV-IS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5136))

Abstract

In model-based user interface (UI) development task models are successively refined into more detailed task specifications. To ensure that analysis information is correctly translated into requirements and design artifacts it is important to verify that for each transformation step the derived task model is a valid refinement of its base specification. In this paper we present a versatile refinement relation between task models based on the principle of mandatory scenario equivalence. Which scenarios are mandatory is determined by metaoperators. These operators are assigned to tasks by the requirements engineer depending on the role of the task model in the development lifecycle.

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. van Welie, M., van der Veer, G., Eliëns, A.: An Ontology for Task World Models. In: DSV-IS 1998. Springer, Abingdon (1998)

    Google Scholar 

  2. Paterno, F.: Model-Based Design and Evaluation of Interactive Applications. Springer, London (1999)

    Google Scholar 

  3. Khendek, F., Bourduas, S., Vincent, D.: Stepwise Design with Message Sequence Charts. In: Proceedings of the IFIP TC6/WG6.1. Kluwer, B.V. (2001)

    Google Scholar 

  4. Brinksma, E., Scollo, G., Steenbergen, C.: Lotos specifications, their implementations and their tests. In: Conformance testing methodologies and architectures for OSI protocols, pp. 468–479. IEEE Computer Society Press, Los Alamitos (1995)

    Google Scholar 

  5. Sinnig, D., Chalin, P., Khendek, F.: Consistency between Task Models and Use Cases. In: Proceedings of Design, Specification and Verification of Interactive Systems 2007. Salamanca, Spain (2007)

    Google Scholar 

  6. Sinnig, D., Wurdel, M., Forbrig, P., Chalin, P., Khendek, F.: Practical Extensions for Task Models. In: Winckler, M., Johnson, H., Palanque, P. (eds.) TAMODIA 2007. LNCS, vol. 4849, pp. 42–55. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Bergstra, J.A.: Handbook of Process Algebra. Elsevier Science Inc., Amsterdam (2001)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

T. C. Nicholas Graham Philippe Palanque

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wurdel, M., Sinnig, D., Forbrig, P. (2008). Task Model Refinement with Meta Operators. In: Graham, T.C.N., Palanque, P. (eds) Interactive Systems. Design, Specification, and Verification. DSV-IS 2008. Lecture Notes in Computer Science, vol 5136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70569-7_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70569-7_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70568-0

  • Online ISBN: 978-3-540-70569-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics