Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Fast randomized consensus using shared memory
Journal of Algorithms
Symmetry breaking in distributed networks
Information and Computation
Algebraic decision diagrams and their applications
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Symbolic Model Checking
Faster and Symbolic CTMC Model Checking
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reachability Analysis of Probabilistic Systems by Successive Refinements
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Symbolic Model Checking for Probabilistic Processes
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Model Checking Continuous-Time Markov Chains by Transient Analysis
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
A Toolbox for Functional and Quantitative Analysis of DEDS
TOOLS '98 Proceedings of the 10th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
ProbVerus: Probabilistic Symbolic Model Checking
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Data Structure for the Efficient Kronecker Solution of GSPNs
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
ON THE USE OF KRONECKER OPERATORS FOR THE SOLUTION OF GENERALIZED STOCHASTIC PETRI NETS
ON THE USE OF KRONECKER OPERATORS FOR THE SOLUTION OF GENERALIZED STOCHASTIC PETRI NETS
Compact Representations of Probability Distributions in the Analysis of Superposed GSPNs
PNPM '01 Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01)
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Out-of-Core Solution of Large Linear Systems of Equations Arising from Stochastic Modelling
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Deriving Symbolic Representations from Stochastic Process Algebras
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Verifying Randomized Byzantine Agreement
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
A Probabilistic Extension of UML Statecharts
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
On Combining Functional Verification and Performance Evaluation Using CADP
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
PRISM: Probabilistic Symbolic Model Checker
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Model Checking CSL until Formulae with Random Time Bounds
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Software performance modelling using PEPA nets
WOSP '04 Proceedings of the 4th international workshop on Software and performance
Timed model checking of security protocols
Proceedings of the 2004 ACM workshop on Formal methods in security engineering
Reasoning about partial goal satisfaction for requirements and design engineering
Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
Formal modeling and quantitative analysis of KLAIM-based mobile systems
Proceedings of the 2005 ACM symposium on Applied computing
On probabilistic program equivalence and refinement
CONCUR 2005 - Concurrency Theory
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Symmetry in temporal logic model checking
ACM Computing Surveys (CSUR)
Uniform random sampling of traces in very large models
Proceedings of the 1st international workshop on Random testing
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
Timed analysis of security protocols
Journal of Computer Security - Formal Methods in Security Engineering Workshop (FMSE 04)
A Fluid Flow Approach to Usability Analysis of Multi-user Systems
HCSE-TAMODIA '08 Proceedings of the 2nd Conference on Human-Centered Software Engineering and 7th International Workshop on Task Models and Diagrams
Analysing Biochemical Oscillation through Probabilistic Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Studying Irreversible Transitions in a Model of Cell Cycle Regulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Resilience of Interaction Techniques to Interrupts: A Formal Model-Based Approach
INTERACT '09 Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I
Continuous-Time Probabilistic KLAIM
Electronic Notes in Theoretical Computer Science (ENTCS)
Estimating the Cost of Native Method Calls for Resource-bounded Functional Programming Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Compositional theories of qualitative and quantitative behaviour
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
MOTOR: the MODEST tool environment
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Query-based verification of qualitative trends and oscillations in biochemical systems
Theoretical Computer Science
Requirements reflection: requirements as runtime entities
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 2
A design environment for mobile applications
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A fuzzy service adaptation based on QoS satisfaction
CAiSE'11 Proceedings of the 23rd international conference on Advanced information systems engineering
An MTBDD-based implementation of forward reachability for probabilistic timed automata
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Towards automated proof support for probabilistic distributed systems
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Probabilistic linda-based coordination languages
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Quantitative refinement and model checking for the analysis of probabilistic systems
FM'06 Proceedings of the 14th international conference on Formal Methods
Transactions on Computational Systems Biology VII
Towards model checking stochastic aspects of the thinkteam user interface
DSVIS'05 Proceedings of the 12th international conference on Interactive Systems: design, specification, and verification
Ten years of saturation: a petri net perspective
Transactions on Petri Nets and Other Models of Concurrency V
Compositional verification of architectural models
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
An overview of the mCRL2 toolset and its recent advances
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Hi-index | 0.00 |
In this paper we introduce PRISM, a probabilistic model checker, and describe the efficient symbolic techniques we have developed during its implementation. PRISM is a tool for analysing probabilistic systems. It supports three models: discrete-time Markov chains, continuous-time Markov chains and Markov decision processes. Analysis is performed through model checking specifications in the probabilistic temporal logics PCTL and CSL. 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 MTBDDs (multi-terminal BDDs) and BDDs. Existing work in this direction has been hindered by the generally poor performance of MTBDD-based numerical computation, which is often substantially slower than explicit methods using sparse matrices. We present a novel hybrid technique which combines aspects of symbolic and explicit approaches to overcome these performance problems. For typical examples, we achieve orders of magnitude speed-up compared to MTBDDs and are able to almost match the speed of sparse matrices whilst maintaining considerable space savings.