MoDeST --- a modelling and description language for stochastic timed systems. 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 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 35 articles , 1 standard article )

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

1 2 next

  1. Hartmanns, Arnd; Katoen, Joost-Pieter; Kohlen, Bram; Spel, Jip: Tweaking the odds in probabilistic timed automata (2021)
  2. Kaalen, Stefan; Nyberg, Mattias; Mattsson, Olle: Transient analysis of hierarchical semi-Markov process models with tool support in Stateflow (2021)
  3. Pilch, Carina; Schupp, Stefan; Remke, Anne: Optimizing reachability probabilities for a restricted class of stochastic hybrid automata via flowpipe-construction (2021)
  4. Lavaei, Abolfazl; Khaled, Mahmoud; Soudjani, Sadegh; Zamani, Majid: AMYTISS: a parallelized tool on automated controller synthesis for large-scale stochastic systems (2020)
  5. Cauchi, Nathalie; Abate, Alessandro: Poster abstract: StocHy -- automated verification and synthesis of stochastic processes. (2019)
  6. Baier, Christel; de Alfaro, Luca; Forejt, Vojtěch; Kwiatkowska, Marta: Model checking probabilistic systems (2018)
  7. Bouyer, Patricia; Brihaye, Thomas; Carlier, Pierre; Menet, Quentin: Compositional design of stochastic timed automata (2016)
  8. Garavel, Hubert: Revisiting sequential composition in process calculi (2015)
  9. Latella, Diego; Massink, Mieke; de Vink, Erik P.: Bisimulation of labelled state-to-function transition systems coalgebraically (2015)
  10. Gómez, Rodolfo: Model-checking timed automata with deadlines with Uppaal (2013)
  11. Hahn, Ernst Moritz; Hartmanns, Arnd; Hermanns, Holger; Katoen, Joost-Pieter: A compositional modelling and analysis framework for stochastic hybrid systems (2013)
  12. Norman, Gethin; Parker, David; Sproston, Jeremy: Model checking for probabilistic timed automata (2013)
  13. D’Argenio, Pedro R.; Sánchez Terraf, Pedro; Wolovick, Nicolás: Bisimulations for non-deterministic labelled Markov processes (2012)
  14. Katoen, Joost-Pieter; van de Pol, Jaco; Stoelinga, Mariëlle; Timmer, Mark: A linear process-algebraic format with data for probabilistic automata (2012)
  15. 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)
  16. Fietzke, Arnaud; Hermanns, Holger; Weidenbach, Christoph: Superposition-based analysis of first-order probabilistic timed automata (2010)
  17. Hillston, Jane: Process algebras for collective dynamics. (Extended abstract) (2010) ioport
  18. Mader, Angelika; Bohnenkamp, Henrik; Usenko, Yaroslav S.; Jansen, David N.; Hurink, Johann; Hermanns, Holger: Synthesis and stochastic assessment of cost-optimal schedules (2010) ioport
  19. 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)
  20. Gómez, Rodolfo: A compositional translation of timed automata with deadlines to Uppaal timed automata (2009)

1 2 next

Further publications can be found at: