Skip to main content
SpringerLink
Log in
Book cover

Joint International Workshop von Process Algebra and Probabilistic Methods, Performance Modeling and Verification

PAPM-PROBMIV 2001: Process Algebra and Probabilistic Methods. Performance Modelling and Verification pp 87–104Cite as

MoDeST — A Modelling and Description Language for Stochastic Timed Systems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2165))

Abstract

This paper presents a modelling language, called MoDeST, for describing the behaviour of discrete event systems. The language combines conventional programming constructs — such as iteration, alternatives, atomic statements, and exception handling — with means to describe complexsystems in a compositional manner. In addition, MoDeST incorporates means to describe important phenomena such as non-determinism, probabilistic branching, and hard real-time as well as soft real-time (i.e., stochastic) aspects. The language is influenced by popular and user-friendly specification languages such as Promela, and deals with compositionality in a light-weight process-algebra style. Thus, MoDeST (i) covers a very broad spectrum of modelling concepts, (ii) possesses a rigid, process-algebra style semantics, and (iii) yet provides modern and flexible specification constructs.

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur and D. Dill. A theory of timed automata. Th. Comp. Sc., 126:183–235, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  2. C. Baier, J.-P. Katoen, and H. Hermanns. Approximate symbolic model checking of continuous-time Markov chains. In: J.C.M. Baeten and S. Mauw, eds, Concurrency Theory, LNCS 1664, pp. 146–161. Springer-Verlag, 1999.

    Chapter  Google Scholar 

  3. G. Berry. Preemption and concurrency. In: R.K. Shyamasundar, ed, Found. of Software Techn. and Th. Comp. Sc., LNCS 761, pp. 72–93. Springer-Verlag, 1993.

    Google Scholar 

  4. L. Blair, T. Jones, and G. Blair. Stochastically enhanced timed automata. In: S.F. Smith and C.L. Talcott, eds, Proc. 4th IFIP Conf. on Formal Methods for Open Object-based Distributed Systems (FMOODS’00), pp. 327–347. Kluwer, 2000.

    Google Scholar 

  5. T. Bolognesi and E. Brinksma. Introduction to the ISO Specification Language LOTOS. Computer Netw. and ISDN Sys., 14:25–59, 1987.

    Article  Google Scholar 

  6. S. Bornot and J. Sifakis. An algebraic framework for urgency. Inf. and Comp., 163:172–202, 2001.

    Article  MathSciNet  Google Scholar 

  7. M. Bravetti and Gorrieri. The theory of interactive generalized semi-Markov processes. Th. Comp. Sc., 258, 2001 (to appear).

    Google Scholar 

  8. D. Daly, D.D. Deavours, J.M. Doyle, P.G. Webster, and W.H. Sanders. Mobius: An extensible tool for performance and dependability modeling. In B.R. Haverkort, H.C. Bohnenkamp, and C.U. Smith, eds, Computer Performance Evaluation, LNCS 1786, pp. 332–336. Springer-Verlag, 2000.

    Google Scholar 

  9. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997.

    Google Scholar 

  10. L. de Alfaro, T.A. Henzinger and R. Majudmar. Stochastic modules. Unpublished manuscript, 1999.

    Google Scholar 

  11. P.R. D’Argenio. Algebras and Automata for Timed and Stochastic Systems. PhD thesis, Faculty of Computer Science, University of Twente, 1999.

    Google Scholar 

  12. P.R. D’Argenio. A compositional translation of stochastic automata into timed automata. Technical Report CTIT 00-08, Faculty of Computer Science, University of Twente, 2000.

    Google Scholar 

  13. P.R. D’Argenio, J.-P. Katoen, and E. Brinksma. An algebraic approach to the specification of stochastic systems (extended abstract). In: D. Gries and W.-P. de Roever, eds, Proc. IFIP Working Conf. on Programming Concepts and Methods, pp. 126–147. Chapman & Hall, 1998.

    Google Scholar 

  14. D. Ferrari. Considerations on the insularity of performance evaluation. IEEE Trans. on Soft. Eng., 12(6): 678–683, 1986.

    Google Scholar 

  15. H. Garavel and M. Sighireanu. On the introduction of exceptions in E-LOTOS. In: R. Gotzhein and J. Bredereke, eds, Formal Description Techniques IX, pp. 469–484. Kluwer, 1996.

    Google Scholar 

  16. J. Gosling, B. Joy, and G. Steele. The Java Language Specification. Addison-Wesley, 1996.

    Google Scholar 

  17. C. Harvey. Performance engineering as an integral part of system design. Br. Telecom Technol. J., 4(3): 142–147, 1986.

    Google Scholar 

  18. T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Inf. and Comp., 111:193–244, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  19. H. Hermanns. Interactive Markov Chains. PhD thesis, University of Erlangen-Nürnberg, 1998.

    Google Scholar 

  20. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.

    Google Scholar 

  21. G.J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, 1991.

    Google Scholar 

  22. R. Klaren, P.R. D’Argenio, J.-P. Katoen, and H. Hermanns. Modest language manual. CTIT Tech. Rep. University of Twente, 2001. To appear.

    Google Scholar 

  23. P.R. D’Argenio, H. Hermanns, J.-P. Katoen, and R. Klaren. MoDeST — a modelling and description language for stochastic timed systems. CTIT Tech. Rep., University of Twente, 2001.

    Google Scholar 

  24. J. Kramer and J. McGee. Concurrency: State Models and Java Programs. John Wiley and Sons, 1999.

    Google Scholar 

  25. M. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Automatic verification of real-time systems with probability distributions. In: J.-P. Katoen, ed, Formal Methods for Real-Time and Probabilistic Systems, LNCS 1601, pp. 75–95. Springer-Verlag, 1999.

    Chapter  Google Scholar 

  26. M.Z. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Verifying quantitative properties of continuous probabilistic timed automata. In C. Palamadessi, ed, Concurrency Theory, LNCS, Springer-Verlag, 2000.

    Google Scholar 

  27. K.G. Larsen, P. Pettersson, and W. Yi. Uppaal in a nutshell. Int. J. of Software Tools for Technology Transfer, 1(1/2):134–152, 1997.

    Article  MATH  Google Scholar 

  28. V. Mertsiotakis. Approximate Analysis Methods for Stochastic Process Algebras. PhD thesis, University of Erlangen-Nürnberg, 1998.

    Google Scholar 

  29. J.F. Meyer, A. Movaghar, and W.H. Sanders. Stochastic activity networks: Structure, behavior and application. In: Proc. Int. Workshop on Timed Petri Nets, pp. 106–115, IEEE CS Press, 1985.

    Google Scholar 

  30. M.L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, 1994.

    Google Scholar 

  31. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Dept. of Electrical Eng. and Computer Science, MIT, 1995.

    Google Scholar 

  32. A.N. Shiryaev. Probability, volume 95 of Graduate Texts in Mathematics. Springer-Verlag, 1996.

    Google Scholar 

  33. W. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton University Press, 1994.

    Google Scholar 

  34. W. Yi. Real-time behaviour of asynchronous agents. In: J.C.M. Baeten and J.-W. Klop, eds, CONCUR 90, LNCS 458, pp. 502–520. Springer-Verlag, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Formal Methods and Tools Group, Faculty of Computer Science, University of Twente, P.O. Box 217, 7500, AE Enschede, The Netherlands

    Pedro R. D’Argenio, Holger Hermanns, Joost-Pieter Katoen & Ric Klaren

Authors
  1. Pedro R. D’Argenio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Holger Hermanns
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joost-Pieter Katoen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ric Klaren
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Electr. and Computer Science, University of California at Berkeley, 479 Cory Hall, Berkeley, CA94720-1770, USA

    Luca de Alfaro

  2. Laboratory for Foundations of Computer Science, The University of Edinburgh, Edinburgh, EH9 3JZ, UK

    Stephen Gilmore

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

D’Argenio, P.R., Hermanns, H., Katoen, JP., Klaren, R. (2001). MoDeST — A Modelling and Description Language for Stochastic Timed Systems. In: de Alfaro, L., Gilmore, S. (eds) Process Algebra and Probabilistic Methods. Performance Modelling and Verification. PAPM-PROBMIV 2001. Lecture Notes in Computer Science, vol 2165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44804-7_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-44804-7_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42556-4

  • Online ISBN: 978-3-540-44804-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation