15 Hits in 0.87 sec

ProbVerus: Probabilistic Symbolic Model Checking [chapter]

Vicky Hartonas-Garmhausen, Sergio Campos, Ed Clarke
1999 Lecture Notes in Computer Science  
ProbVerus is an implementation of probabilistic computation tree logic (PCTL) model checking using symbolic techniques.  ...  Model checking can tell us whether a system is correct; probabilistic model checking can also tell us whether a system is timely and reliable.  ...  We have developed ProbVerus, a probabilistic symbolic model checker, which combines Probabilistic Computation Tree Logic (PCTL) model checking [11] and symbolic techniques.  ... 
doi:10.1007/3-540-48778-6_6 fatcat:xkgaiammzfebldjmslb7roximq

Probabilistic symbolic model checking with PRISM: a hybrid approach

Marta Kwiatkowska, Gethin Norman, David Parker
2004 International Journal on Software Tools for Technology Transfer (STTT)  
In this paper we present efficient symbolic techniques for probabilistic model checking.  ...  Motivated by the success of model checkers such as SMV, which use BDDs (binary decision diagrams), we have developed an implementation of PCTL and CSL model checking based on MTB-DDs (multi-terminal BDDs  ...  In this paper we present efficient symbolic techniques for probabilistic model checking.  ... 
doi:10.1007/s10009-004-0140-2 fatcat:xqud3lfsgbhnbm4zaqe3cdkgqi

Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach [chapter]

Marta Kwiatkowska, Gethin Norman, David Parker
2002 Lecture Notes in Computer Science  
Analysis is performed through model checking specifications in the probabilistic temporal logics PCTL and CSL.  ...  In this paper we introduce PRISM, a probabilistic model checker, and describe the efficient symbolic techniques we have developed during its implementation.  ...  Motivated by the success of symbolic model checkers, such as SMV [28] which use BDDs (binary decision diagrams) [11] , we have developed a symbolic probabilistic model checker.  ... 
doi:10.1007/3-540-46002-0_5 fatcat:ad3rvkanubb2xpuagep2mvaqly

PRISM: Probabilistic Symbolic Model Checker [chapter]

Marta Kwiatkowska, Gethin Norman, David Parker
2002 Lecture Notes in Computer Science  
The tool features three model checking engines: one symbolic, using BDDs (binary decision diagrams) and MTBDDs (multi-terminal BDDs); one based on sparse matrices; and one which combines both symbolic  ...  Analysis is performed through model checking such systems against specifications written in the probabilistic temporal logics PCTL and CSL.  ...  Probabilistic model checking A number of probabilistic models exist.  ... 
doi:10.1007/3-540-46029-2_13 fatcat:jcm5csu46rhvnfvd63qlpmz2dm

Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM? [chapter]

Marta Kwiatkowska, Gethin Norman, Roberto Segala
2001 Lecture Notes in Computer Science  
We know of two other probabilistic model checkers, ProbVerus [2] and E T MC 2 [9] (neither of which supports nondeterminism that is essential here).  ...  The coin-flipping protocol is verified using the probabilistic model checker PRISM.  ...  Model Checking of the Coin-Flipping Protocol.  ... 
doi:10.1007/3-540-44585-4_17 fatcat:jbpnxnhy3bauxotxsuh7ao2gum

Bounded Probabilistic Model Checking with the Murφ Verifier [chapter]

Giuseppe Della Penna, Benedetto Intrigila, Igor Melatti, Enrico Tronci, Marisa Venturini Zilli
2004 Lecture Notes in Computer Science  
We give experimental results comparing FHP-Murϕ with (a finite horizon subset of) PRISM, a state-of-the-art symbolic model checker for Markov Chains.  ...  We call FHP-Murϕ (Finite Horizon Probabilistic Murϕ) such extension of the Murϕ verifier.  ...  We presented (Section 4) experimental results comparing FHP-Murϕ with (a finite horizon subset of) PRISM, a state-of-the-art symbolic model checker for Markov Chains.  ... 
doi:10.1007/978-3-540-30494-4_16 fatcat:x77bxaikujfshlvreyz4z5y3wa

A tool for model-checking Markov chains

Joost-Pieter Katoen, Joachim Meyer-Kayser, Markus Siegle, Holger Hermanns
2003 International Journal on Software Tools for Technology Transfer (STTT)  
Model checking of such chains with respect to a given (branching) temporal logic formula has been proposed for both discrete [10, 34] and continuous time settings [7, 12] .  ...  Markov chains are widely used in the context of the performance and reliability modeling of various systems.  ...  The theoretical foundations of ProbVerus have been laid down in [10] . The symbolic model checker PRISM (PRobabIlistic Symbolic Model checker) for MDPs has been recently presented in [3] .  ... 
doi:10.1007/s100090100072 fatcat:4esvw6acwjbljayyljaxa4g4ru

A Markov Chain Model Checker [chapter]

Holger Hermanns, Joost-Pieter Katoen, Joachim Meyer-Kayser, Markus Siegle
2000 Lecture Notes in Computer Science  
For these models, qualitative and quantitative model checking algorithms have been investigated extensively, see e.g. [3, 5, 6, 10, 13, 17, 29] .  ...  If non-determinism is replaced by randomized, i.e. probabilistic decisions, the resulting model boils down to a finitestate discrete-time Markov chain (DTMC).  ...  Other model checkers for probabilistic systems are the DTMC-model checkers ProbVerus [18] and TPWB (the Timing and Probability Work-Bench) [15] , and the recent symbolic model checker for (discrete-time  ... 
doi:10.1007/3-540-46419-0_24 fatcat:uj7ayjdlfbf73ip4snvm6x4uxi

Partial order reduction for probabilistic systems

C. Baier, M. Grosser, F. Ciesinski
2004 First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings.  
In the past, several model checking algorithms have been proposed to verify probabilistic reactive systems.  ...  In this paper, we show how partial order reduction with a variant of Peled's ample set method can be applied in the context of LTL model checking for probabilistic systems modelled by Markov decision processes  ...  To reason about non-probabilistic systems, a variety of methods have been developed to avoid the state-explosion problem, including symbolic model checking with binary decision diagrams, partial order  ... 
doi:10.1109/qest.2004.1348037 dblp:conf/qest/BaierGC04 fatcat:m6s7ixzkmzd5ndi7qivbxq56eu

Model Checking Linear-Time Properties of Probabilistic Systems [chapter]

Christel Baier, Marcus Größer, Frank Ciesinski
2009 Monographs in Theoretical Computer Science  
This includes symbolic model checking methods and various reduction techniques, see, e.g., [21] for an overview.  ...  For instance, the PCTLmodel checkers PRISM [60] , ProbVERUS [48] and RAPTURE [56] are based on a symbolic representation of the system to be analyzed.  ... 
doi:10.1007/978-3-642-01492-5_13 fatcat:n3qjkl2ojreypn7sxc4e7zfvs4

Algorithmic probabilistic game semantics

Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell
2012 Formal methods in system design  
We present a detailed account of a translation from probabilistic call-by-value programs with procedures to Rabin's probabilistic automata.  ...  Since probabilistic language equivalence is decidable, we can apply the translation to analyse the behaviour of probabilistic programs and protocols.  ...  The model-checking algorithms implemented in these tools combine state-of-the-art techniques from non-probabilistic model checking, including symbolic representations [27, 5] , symmetry reduction and  ... 
doi:10.1007/s10703-012-0173-1 fatcat:7ct2rbwysrdorn333xhnxyvzw4

Multi-valued symbolic model-checking

Marsha Chechik, Benet Devereux, Steve Easterbrook, Arie Gurfinkel
2003 ACM Transactions on Software Engineering and Methodology  
This paper introduces the concept of multi-valued model-checking and describes a multi-valued symbolic model-checker χ Chek.  ...  We explore the relationship between χ CTL and CTL, and provide a symbolic modelchecking algorithm for χ CTL. We also address the use of fairness in multi-valued model-checking.  ...  Symbolic probabilistic model-checking has been implemented as part of the tool PROB-VERUS [Baier et al., 1997] .  ... 
doi:10.1145/990010.990011 fatcat:d22iidcvqzdbdcxocflpj6jtya

On the Semantic Foundations of Probabilistic Synchronous Reactive Programs

Christel Baier, Edmund M. Clarke, Vasiliki Hartonas-Garmhausen
1999 Electronical Notes in Theoretical Computer Science  
Second, we provide a denotational semantics for P that also models P by a Markov chain.  ...  Thus, the denotational semantics yields the theoretical foundations of a symbolic model checking tool like Har98] that generates the wait counter graph for P.  ...  Such algorithms can serve as basis for a model checking tool CE81, CES86] that takes as its input a probabilistic program P and its speci cation (e.g. a temporal logical formula) and returns the answer  ... 
doi:10.1016/s1571-0661(05)80594-8 fatcat:e252txv5gzhrlbvl5tlrmsxnqi

How Fast and Fat Is Your Probabilistic Model Checker? An Experimental Performance Comparison [chapter]

David N. Jansen, Joost-Pieter Katoen, Marcel Oldenkamp, Mariëlle Stoelinga, Ivan Zapreev
Hardware and Software: Verification and Testing  
The study considers the model checkers ETMCC, MRMC, PRISM (sparse and hybrid mode), YMER and VESTA, and focuses on fully probabilistic systems.  ...  This paper studies the efficiency of several probabilistic model checkers by comparing verification times and peak memory usage for a set of standard case studies.  ...  This allows researchers from various areas to apply probabilistic model checking.  ... 
doi:10.1007/978-3-540-77966-7_9 dblp:conf/hvc/JansenKOSZ07 fatcat:hjvbryqdxrczvakpks5no775u4

PROBMELA: a modeling language for communicating probabilistic processes

C. Baier, F. Ciesinski, M. Grosser
Proceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2004. MEMOCODE '04.  
Building automated tools to address the analysis of reactive probabilistic systems requires a simple, but expressive input language with a formal semantics based on a probabilistic operational model that  ...  Applied to finite-state systems, the semantics can serve as basis for the algorithmic generation of a Markov decision process that models the stepwise behavior of the given system.  ...  auto-mated analysis (e.g., simulation or model checking against temporal logical specifications).  ... 
doi:10.1109/memcod.2004.1459815 dblp:conf/memocode/BaierCG04 fatcat:nvldoe4w2rcq7nqdpksdi5e3my