Sciweavers

23 search results - page 1 / 5
» Symbolic Model Checking of Probabilistic Processes Using MTB...
Sort
View
TACAS
2000
Springer
138views Algorithms» more  TACAS 2000»
13 years 7 months ago
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent...
Luca de Alfaro, Marta Z. Kwiatkowska, Gethin Norma...
ATVA
2006
Springer
123views Hardware» more  ATVA 2006»
13 years 8 months ago
Symmetry Reduction for Probabilistic Model Checking Using Generic Representatives
Generic representatives have been proposed for the effective combination of symmetry reduction and symbolic representation with BDDs in non-probabilistic model checking. This appro...
Alastair F. Donaldson, Alice Miller
ATVA
2005
Springer
131views Hardware» more  ATVA 2005»
13 years 10 months ago
An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
Fuzhi Wang, Marta Z. Kwiatkowska
VOSS
2004
Springer
152views Mathematics» more  VOSS 2004»
13 years 9 months ago
Symbolic Representations and Analysis of Large Probabilistic Systems
Abstract. This paper describes symbolic techniques for the construction, representation and analysis of large, probabilistic systems. Symbolic approaches derive their efficiency by...
Andrew S. Miner, David Parker
CAV
2006
Springer
132views Hardware» more  CAV 2006»
13 years 8 months ago
Symmetry Reduction for Probabilistic Model Checking
We present an approach for applying symmetry reduction techniques to probabilistic model checking, a formal verification method for the quantitative analysis of systems with stocha...
Marta Z. Kwiatkowska, Gethin Norman, David Parker