1341 search results - page 80 / 269 » Probabilistic Abstraction Hierarchies |
208
click to vote
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to ver...
166
click to vote
IFM
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. Event-B is a notation and method for discrete systems modelling by refinement. We introduce a small but very useful construction: qualitative probabilistic choice. It ex...
164
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
152
click to vote
ICANN
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...
178
click to vote
ICFEM
2007
Springer
15 years 10 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...