102 search results - page 20 / 21 » Symbolic Model Checking for Probabilistic Processes |
108
click to vote
HYBRID
2010
Springer
15 years 7 months ago
2010
Springer
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The success of probabilistic model checking for discrete-time Markov decision processes and continuous-time Markov chains has led to rich academic and industrial applications. The ...
111
click to vote
SOFSEM
2007
Springer
15 years 7 months ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
179
click to vote
JUCS
2010
14 years 8 months ago
2010
: All processes of life are controlled by networks of interacting biochemical components. The purpose of modelling these networks is manifold. From a theoretical point of view it a...
106
click to vote
POPL
2010
ACM
15 years 10 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...