MODEST: A modelling language for stochastic timed systems

P.R. d' Argenio, H. Hermanns, Joost P. Katoen, J. Klaren

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

16 Downloads (Pure)

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.
Original languageUndefined
Title of host publicationJoint Int. Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM-PROBMIV)
EditorsL. de Alfaro, S. Gilmore
Place of PublicationBerlin
PublisherSpringer
Pages87-104
Number of pages18
ISBN (Print)3-540-42556-X
DOIs
Publication statusPublished - Sep 2001

Publication series

NameLecture Notes in Computer Science 2165
PublisherSpringer-Verlag
Volume2165
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • METIS-204137
  • EWI-946
  • IR-37170

Cite this

d' Argenio, P. R., Hermanns, H., Katoen, J. P., & Klaren, J. (2001). MODEST: A modelling language for stochastic timed systems. In L. de Alfaro, & S. Gilmore (Eds.), Joint Int. Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM-PROBMIV) (pp. 87-104). (Lecture Notes in Computer Science 2165; Vol. 2165). Berlin: Springer. https://doi.org/10.1007/3-540-44804-7_6
d' Argenio, P.R. ; Hermanns, H. ; Katoen, Joost P. ; Klaren, J. / MODEST: A modelling language for stochastic timed systems. Joint Int. Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM-PROBMIV). editor / L. de Alfaro ; S. Gilmore. Berlin : Springer, 2001. pp. 87-104 (Lecture Notes in Computer Science 2165).
@inproceedings{9998764139be43f9abb05bc67a5151e9,
title = "MODEST: A modelling language for stochastic timed systems",
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.",
keywords = "METIS-204137, EWI-946, IR-37170",
author = "{d' Argenio}, P.R. and H. Hermanns and Katoen, {Joost P.} and J. Klaren",
note = "Imported from DIES",
year = "2001",
month = "9",
doi = "10.1007/3-540-44804-7_6",
language = "Undefined",
isbn = "3-540-42556-X",
series = "Lecture Notes in Computer Science 2165",
publisher = "Springer",
pages = "87--104",
editor = "{de Alfaro}, L. and S. Gilmore",
booktitle = "Joint Int. Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM-PROBMIV)",

}

d' Argenio, PR, Hermanns, H, Katoen, JP & Klaren, J 2001, MODEST: A modelling language for stochastic timed systems. in L de Alfaro & S Gilmore (eds), Joint Int. Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM-PROBMIV). Lecture Notes in Computer Science 2165, vol. 2165, Springer, Berlin, pp. 87-104. https://doi.org/10.1007/3-540-44804-7_6

MODEST: A modelling language for stochastic timed systems. / d' Argenio, P.R.; Hermanns, H.; Katoen, Joost P.; Klaren, J.

Joint Int. Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM-PROBMIV). ed. / L. de Alfaro; S. Gilmore. Berlin : Springer, 2001. p. 87-104 (Lecture Notes in Computer Science 2165; Vol. 2165).

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - MODEST: A modelling language for stochastic timed systems

AU - d' Argenio, P.R.

AU - Hermanns, H.

AU - Katoen, Joost P.

AU - Klaren, J.

N1 - Imported from DIES

PY - 2001/9

Y1 - 2001/9

N2 - 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.

AB - 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.

KW - METIS-204137

KW - EWI-946

KW - IR-37170

U2 - 10.1007/3-540-44804-7_6

DO - 10.1007/3-540-44804-7_6

M3 - Conference contribution

SN - 3-540-42556-X

T3 - Lecture Notes in Computer Science 2165

SP - 87

EP - 104

BT - Joint Int. Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM-PROBMIV)

A2 - de Alfaro, L.

A2 - Gilmore, S.

PB - Springer

CY - Berlin

ER -

d' Argenio PR, Hermanns H, Katoen JP, Klaren J. MODEST: A modelling language for stochastic timed systems. In de Alfaro L, Gilmore S, editors, Joint Int. Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM-PROBMIV). Berlin: Springer. 2001. p. 87-104. (Lecture Notes in Computer Science 2165). https://doi.org/10.1007/3-540-44804-7_6