Sciweavers

502 search results - page 12 / 101
» Model Checking Timed Systems with Priorities
Sort
View
AIPS
2007
13 years 10 months ago
Using Adaptive Priority Weighting to Direct Search in Probabilistic Scheduling
Many scheduling problems reside in uncertain and dynamic environments – tasks have a nonzero probability of failure and may need to be rescheduled. In these cases, an optimized ...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...
CONCUR
1999
Springer
14 years 3 days ago
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
d abstract) Christel Baiera, Joost-Pieter Katoenb;c and Holger Hermannsc aLehrstuhl fur Praktische Informatik II, University of Mannheim 68131 Mannheim, Germany bLehrstuhl fur Info...
Christel Baier, Joost-Pieter Katoen, Holger Herman...
FORMATS
2004
Springer
14 years 1 months ago
Symbolic Model Checking for Probabilistic Timed Automata
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
ECAI
2010
Springer
13 years 9 months ago
The Complexity of Epistemic Model Checking: Clock Semantics and Branching Time
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...
Xiaowei Huang, Ron van der Meyden
FM
2003
Springer
139views Formal Methods» more  FM 2003»
14 years 1 months ago
Combining Real-Time Model-Checking and Fault Tree Analysis
We present a semantics for fault tree analysis, a technique used for the analysis of safety critical systems, in the real-time interval logic Duration Calculus with Liveness and sh...
Andreas Schäfer