MoDeST --- a modelling and description language for stochastic timed systemsThis 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 complex systems 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

References in zbMATH (referenced in 28 articles , 1 standard article )

Showing results 1 to 20 of 28.
Sorted by year (citations)

1 2 next

  1. Garavel, Hubert: Revisiting sequential composition in process calculi (2015)
  2. Latella, Diego; Massink, Mieke; De Vink, Erik P.: Bisimulation of labelled state-to-function transition systems coalgebraically (2015)
  3. Gómez, Rodolfo: Model-checking timed automata with deadlines with Uppaal (2013)
  4. Hahn, Ernst Moritz; Hartmanns, Arnd; Hermanns, Holger; Katoen, Joost-Pieter: A compositional modelling and analysis framework for stochastic hybrid systems (2013)
  5. Norman, Gethin; Parker, David; Sproston, Jeremy: Model checking for probabilistic timed automata (2013)
  6. D’Argenio, Pedro R.; Sánchez Terraf, Pedro; Wolovick, Nicolás: Bisimulations for non-deterministic labelled Markov processes (2012)
  7. Katoen, Joost-Pieter; van de Pol, Jaco; Stoelinga, Mariëlle; Timmer, Mark: A linear process-algebraic format with data for probabilistic automata (2012)
  8. Markovski, J.; D’argenio, P.R.; Baeten, J.C.M.; de Vink, E.P.: Reconciling real and stochastic time: the need for probabilistic refinement (2012)
  9. Fietzke, Arnaud; Hermanns, Holger; Weidenbach, Christoph: Superposition-based analysis of first-order probabilistic timed automata (2010)
  10. Hillston, Jane: Process algebras for collective dynamics. (Extended abstract) (2010)
  11. Mader, Angelika; Bohnenkamp, Henrik; Usenko, Yaroslav S.; Jansen, David N.; Hurink, Johann; Hermanns, Holger: Synthesis and stochastic assessment of cost-optimal schedules (2010)
  12. van Beek, D.A.; Cuijpers, P.J.L.; Markovski, J.; Nadales Agut, D.E.; Rooda, J.E.: Reconciling urgency and variable abstraction in a hybrid compositional setting (2010)
  13. Gómez, Rodolfo: A compositional translation of timed automata with deadlines to Uppaal timed automata (2009)
  14. Markovski, Jasen; de Vink, Erik P.: Performance evaluation of distributed systems based on a discrete real- and stochastic-time process algebra (2009)
  15. Xu, TianHua; Tang, Tao; Gao, ChunHai; Cai, BaiGen: Dependability analysis of the data communication system in train control system (2009)
  16. Markovski, Jasen; de Vink, Erik P.: Extending timed process algebra with discrete stochastic time (2008)
  17. Meyer, Roland; Faber, Johannes; Hoenicke, Jochen; Rybalchenko, Andrey: Model checking duration calculus: a practical approach (2008)
  18. Bernardo, Marco: A survey of Markovian behavioral equivalences (2007)
  19. Hillston, Jane; Kloul, Leïla: Formal techniques for performance analysis: blending SAN and PEPA (2007)
  20. Alur, Rajeev; Bernadsky, Mikhail: Bounded model checking for GSMP models of stochastic real-time systems (2006)

1 2 next

Further publications can be found at: