1980 search results - page 42 / 396 » Compositional Model Checking of Real Time Systems |
118
click to vote
FORMATS
2004
Springer
15 years 5 months ago
2004
Springer
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
105
click to vote
ECAI
2010
Springer
15 years 26 days ago
2010
Springer
In the clock semantics for epistemic logic, two situations are indistinguishable for an agent when it makes the same observation and the time in the situations is the same. The pa...
121
click to vote
FAC
2008
14 years 12 months ago
2008
Abstract. Model checking of real-time systems against Duration Calculus (DC) specifications requires the translation of DC formulae into automata-based semantics. The existing algo...
CAV
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. In this paper, we reduce pushdown system (PDS) model checking to a graphtheoretic problem, and apply a fast graph algorithm to improve the running time for model checking...
103
click to vote
ECRTS
2003
IEEE
15 years 5 months ago
2003
IEEE
Advances in scheduling theory have given designers of control systems greater flexibility over their choice of timing requirements. This could lead to systems becoming more respon...