145
click to vote
PAPM
15 years 7 months ago
2001 Springer 
Abstract. This paper reports on the implementation and the experiments with symbolic model checking of continuous-time Markov chains using multi-terminal binary decision diagrams (...
119
click to vote
PAPM
15 years 7 months ago
2001 Springer
Abstract. Recent investigations have shown that the automated verification of continuous-time Markov chains (CTMCs) against CSL (Continuous Stochastic Logic) can be performed in a...
100
click to vote
PAPM
15 years 7 months ago
2001 Springer 
This paper presents a modelling language, called MoDeST, for describing the behaviour of discrete event systems. The language combines conventional programming constructs – such ...
|
Mathematics