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.
|Name||Lecture Notes in Computer Science 2165|
|Conference||Process Algebra and Probabilistic Methods - Performance Modelling in Verification, PAPM-PROBMIV 2001|
|Period||12/09/01 → 14/09/01|