321 search results - page 3 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
155
click to vote
RTSS
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...
169
click to vote
SPIN
2001
Springer
15 years 8 months ago
2001
Springer
p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations conform to the input syntax of the wi...
216
Voted
ARTS
1999
Springer
15 years 7 months ago
1999
Springer
Model checking can tell us whether a system is correct; probabilistic model checking can also tell us whether a system is timely and reliable. Moreover, probabilistic model checkin...
150
Voted
FORMATS
2003
Springer
15 years 8 months ago
2003
Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
132
Voted
FORTE
2007
15 years 4 months ago
2007
Abstract. The publish-subscribe architectural style has recently emerged as a promising approach to tackle the dynamism of modern distributed applications. The correctness of these...