1463 search results - page 254 / 293 » Model Checking Implicit-Invocation Systems |
107
click to vote
IEEESCC
2006
IEEE
15 years 7 months ago
2006
IEEE
A virtual organization (VO) is a dynamic collection of entities (individuals, enterprises, and information resources) collaborating on some computational activity. VOs are an emer...
QEST
2006
IEEE
15 years 7 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
127
click to vote
FORMATS
2003
Springer
15 years 6 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...
113
click to vote
CONCUR
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
109
click to vote
ADAEUROPE
2005
Springer
15 years 6 months ago
2005
Springer
This paper describes the design and implementation of GNAT Pro for ERC32, a flexible cross-development environment supporting the Ravenscar tasking model on top of bare ERC32 comp...