Skip to main content

Early Validation of Deployment and Scheduling Constraints for MSC Specifications

  • Conference paper
System Analysis and Modeling (SAM 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3319))

Included in the following conference series:

Abstract

Message Sequence Charts are widely used for the specification of functional requirements, including timing requirements. These requirements can be validated and used as input for the design stage, and subsequent phases. Deployment constraints are generally taken into account at the implementation stage only. These constraints may conflict and invalidate some of the functional/behavioral requirements already validated at a high level of abstraction in the requirement phase. In this paper, we propose to take into account some deployment constraints at the very early stage of development and check if the system functional requirements will not be impossible to meet at later stages when constraints like communication channel delays, process assignment to CPUs, and scheduling policies are taken into account.

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 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. Alur, R., Holzmann, G., Peled, D.: An analyzer for message sequence charts. Tools and Algorithms for Construction and Analysis of Systems. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 35–48. Springer, Heidelberg (1996)

    Google Scholar 

  2. Alur, R., Yannakakis, M.: Model checking of message sequence charts. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 114–129. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  3. Alur, R., Etessami, K., Yannakakis, M.: Realizability and verification of MSC graphs. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 797–808. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Alvarez, J., Diaz, M., Llopis, L., Pimentel, E., Troya, J.: Integrating schedulability analysis and SDL in an object-oriented methodology for embedded real-time systems. In: 9th SDL Forum, Montréal, Canada, pp. 241–256. Elsevier, Amsterdam (1999)

    Google Scholar 

  5. Alvarez, J., Diaz, M., Llopis, L., Pimentel, E., Troya, J.: Schedulability analysis in real-time embedded systems specified in SDL. In: Workshop on Real-Time Programming, Palma de Mallorca, Spain, pp. 125–131. Elsevier Science, Amsterdam (2000)

    Google Scholar 

  6. Amnell, T., Fersman, E., Mokrushin, L., Pettersson, P., Yi, W.: TIMES: a toolfor schedulability analysis and code generation of real-time systems. In: Formal Modeling and Analysis of Timed Systems. LNCS, vol. 2761. Springer, Heidelberg (2003)

    Google Scholar 

  7. Braberman, V.: On integrating scheduling theory into formal models for hard real time systems. In: WorkShop on Formal Methods for the Design of Real-Time Systems, Villa Olmo, Como, Italy (1997)

    Google Scholar 

  8. Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49, 61–95 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  9. Faltin, N., Lambert, L., Mitshele-Thiel, A., Slomka, F.: An annotational extension of message sequence charts to support performance engineering. In: 8th SDL Forum, Every, France, pp. 307–322. Elsevier Science, Amsterdam (1997)

    Google Scholar 

  10. Fersman, E., Pettersson, P., Yi, W.: Timed automata with asynchronous processes: Schedulability and decidability. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 67–82. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. ITU-T: Recommendation Z.120 (11/99), Message Sequence Charts (MSC). International Telecommunication Union, Geneva

    Google Scholar 

  12. ITU-T: Recommendation Z.100 (08/02), Specification and Description Language (SDL). International Telecommunication Union, Geneva

    Google Scholar 

  13. Lime, D., Roux, O.: Expressiveness and analysis of scheduling extended time Petri nets. In: 5th IFAC International Conference on Fieldbus Systems and their Applications (FET 2003), Aveiro, Portugal. Elsevier Science, Amsterdam (2003)

    Google Scholar 

  14. Norström, C., Wall, A., Yi, W.: Timed automata as task models for event-driven systems. In: Real-Time Computing Systems and Applications, Hong Kong, China. IEEE Press, Los Alamitos (1999)

    Google Scholar 

  15. Peled, G.: Specification and verification using message sequence charts. In: Electronic Notes in Theoretical Computer Science, vol. 65. Elsevier Science, Amsterdam (2002)

    Google Scholar 

  16. Robert, P., Juanol, G.: Modélisation et vérification de politiques d’ordonnancement de tâches temps-réeel. In: 8éme Colloque Francophone sur l’Ingéenierie des Protocoles (CFIP 2000), Toulouse, France, Hermes Science, pp. 167–182 (2000)

    Google Scholar 

  17. Robert, P., Juanol, G.: Modélisation et évaluation de performances d’une architecture d’ordonnancement hétérogène. Application à un système vidéo à qualité de service garantie. In: 9th Conference on Real-time and Embedded Systems (RTS 2001), Paris, France, pp. 27–42 (2001)

    Google Scholar 

  18. Robert, P.: Contributions à un système vidéo à qualité de service garantie appliqué à une fonction de guidage (phase finale d’atterrissage) par acquisition de l’environnement. PhD thesis, Université Paul Sabatier, Toulouse, France (2001)

    Google Scholar 

  19. Roux, O., Déplanche, A.: Extension des réseaux de Petri T-temporels pour la modélisation de l’ordonnancement de taches temps-réel. In: 3e congrès Modélisation des Systèmes Réactifs (MSR 2001), Toulouse, France, Hermes Science, pp. 327–342 (2001)

    Google Scholar 

  20. Roux, O., Déplanche, A.: A T-time Petri net extension for real time-task scheduling modeling. European Journal of Automation (JESA) 36 (2002)

    Google Scholar 

  21. Slomka, F., Zant, J., Lambert, L.: Schedulability analysis of heterogeneous systems for performance message sequence chart. In: Workshop on Hardware/software codesign, Seattle, Washington, United States, pp. 91–95. IEEE Computer Society Press, Los Alamitos (1998)

    Chapter  Google Scholar 

  22. Zheng, T.: Validation and Refinement of Timed MSC Specifications. PhD thesis, Concordia University, Montreal, Canada (2004)

    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

Khendek, F., Lohr, C., Wang, L.X., Zhang, X.J., Zheng, T. (2005). Early Validation of Deployment and Scheduling Constraints for MSC Specifications. In: Amyot, D., Williams, A.W. (eds) System Analysis and Modeling. SAM 2004. Lecture Notes in Computer Science, vol 3319. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31810-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31810-1_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24561-2

  • Online ISBN: 978-3-540-31810-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics