Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Model-checking for probabilistic real-time systems (extended abstract)
Proceedings of the 18th international colloquium on Automata, languages and programming
Real-time symbolic model checking for discrete time models
Theories and experiences for real-time system development
The complexity of probabilistic verification
Journal of the ACM (JACM)
Time and Probability in Formal Design of Distributed Systems
Time and Probability in Formal Design of Distributed Systems
It Usually Works: The Temporal Logic of Stochastic Systems
Proceedings of the 7th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Verification of a Safety-Critical Railway Interlocking System with Real-Time Constraints
FTCS '98 Proceedings of the The Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing
Probabilistic temporal logics for finite and bounded models
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A quantitative approach to the formal verification of real-time systems
A quantitative approach to the formal verification of real-time systems
Probabilistic symbolic model checking with engineering models and applications
Probabilistic symbolic model checking with engineering models and applications
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Markovian analysis of large finite state machines
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
PRTS: an approach for model checking probabilistic real-time hierarchical systems
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Quantitative temporal logic mechanized in HOL
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Algorithmic probabilistic game semantics
Formal Methods in System Design
| Hi-index | 0.00 |
Model checking can tell us whether a system is correct; probabilistic model checking can also tell us whether a system is timely and reliable. Moreover, probabilistic model checking allows one to verify properties that may not be true with probability one, but may still hold with an acceptable probability. The challenge in developing a probabilistic model checker able to handle realistic systems is the construction of the state space and the necessity to solve huge systems of linear equations. To address this problem, we have developed ProbVerus, a tool for the formal verification of probabilistic real-time systems. ProbVerus is an implementation of probabilistic computation tree logic (PCTL) model checking using symbolic techniques. We present ProbVerus, demonstrate its use with a simple manufacturing example, and report the current status of the tool. With ProbVerus, we have been able to analyze, within minutes, the safety logic of a railway interlocking controller with 1027 states.