73 search results - page 14 / 15 » Model Checking Action- and State-Labelled Markov Chains |
QEST
2006
IEEE
14 years 5 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...
ICTAC
2005
Springer
14 years 4 months ago
2005
Springer
In distributed and mobile systems with volatile bandwidth and fragile connectivity, non-functional aspects like performance and reliability become more and more important. To forma...
ECCV
2004
Springer
15 years 29 days ago
2004
Springer
Abstract. This paper presents a novel approach to sign language recognition that provides extremely high classification rates on minimal training data. Key to this approach is a 2 ...
AAAI
2010
14 years 16 days ago
2010
We present a method for unsupervised learning of event classes from videos in which multiple actions might occur simultaneously. It is assumed that all such activities are produce...
SIGSOFT
2007
ACM
14 years 11 months ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...