171 search results - page 8 / 35 » Hypervolume Approximation in Timed Automata Model Checking |
ECBS
2009
IEEE
15 years 4 months ago
2009
IEEE
Probabilistic models are useful for analyzing systems which operate under the presence of uncertainty. In this paper, we present a technique for verifying safety and liveness prop...
81
Voted
RTCSA
1999
IEEE
15 years 1 months ago
1999
IEEE
Scheduling in an environment with constraints of many different types is known to be a hard problem. We tackle this problem for an integrated steel plant in Ghent, Belgium, using ...
IPL
2007
14 years 9 months ago
2007
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
FM
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The paper introduces the construct of temporal testers as a compositional basis for the construction of automata corresponding to temporal formulas in the PSL logic. Temp...
118
click to vote
CAV
1994
Springer
15 years 1 months ago
1994
Springer
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a...