118 search results - page 9 / 24 » Model Checking Durational Probabilistic Systems |
129
click to vote
QEST
2008
IEEE
15 years 9 months ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
128
click to vote
ICFEM
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
153
Voted
ATVA
2006
Springer
15 years 6 months ago
2006
Springer
Generic representatives have been proposed for the effective combination of symmetry reduction and symbolic representation with BDDs in non-probabilistic model checking. This appro...
123
Voted
SIGSOFT
2009
ACM
16 years 3 months ago
2009
ACM
System specifications have long been expressed through automata-based languages, enabling verification techniques such as model checking. These verification techniques can assess ...
131
Voted
VMCAI
2010
Springer
15 years 12 months ago
2010
Springer
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...