Process algebra model of Ada protected objects
ACM SIGPLAN Notices
Deductive Verification of Probabilistic Real-Time Systems
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Abstraction and refinement in probabilistic systems
ACM SIGMETRICS Performance Evaluation Review
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Model checking discounted temporal properties
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
On finite-state approximants for probabilistic computation tree logic
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
A Probabilistic Model for Molecular Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
State explosion in almost-sure probabilistic reachability
Information Processing Letters
A linear time algorithm for pricing european sequential barrier options
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Induction for positive almost sure termination
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Quantitative verification: models techniques and tools
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Quantitative verification: models, techniques and tools
The 6th Joint Meeting on European software engineering conference and the ACM SIGSOFT symposium on the foundations of software engineering: companion papers
Specification patterns for probabilistic quality properties
Proceedings of the 30th international conference on Software engineering
Automata, Probability, and Recursion
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation
Electronic Notes in Theoretical Computer Science (ENTCS)
An Algebraic Framework for Defining Random Concurrent Behaviours
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Monitoring probabilistic properties
Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Memoryless Strategies for Stochastic Games via Domain Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic Analysis of a Non-Repudiation Protocol
Electronic Notes in Theoretical Computer Science (ENTCS)
Abstraction and Probabilities for Hybrid Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Symbolic analysis for GSMP models with one stateful clock
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Probabilistic timed behavior trees
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Three-valued abstractions of Markov chains: completeness for a sizeable fragment of PCTL
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Temporal verification of probabilistic multi-agent systems
Pillars of computer science
Bounded model checking for GSMP models of stochastic real-time systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Recursive markov decision processes and recursive stochastic games
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Probabilistic model checking of biological systems with uncertain kinetic rates
Theoretical Computer Science
ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Computing the expected accumulated reward and gain for a subclass of infinite markov chains
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On the decidability of temporal properties of probabilistic pushdown automata
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Algorithmic verification of recursive probabilistic state machines
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Improved probabilistic models for 802.11 protocol verification
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Model checking durational probabilistic systems
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Combining extended UML models and formal methods to analyze real-time systems
SAFECOMP'05 Proceedings of the 24th international conference on Computer Safety, Reliability, and Security
Verifying probabilistic procedural programs
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Model Checking of Recursive Probabilistic Systems
ACM Transactions on Computational Logic (TOCL)
Proving positive almost sure termination under strategies
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Analysis of recursive probabilistic models
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
An Algebraic Framework for Defining Random Concurrent Behaviours
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
A Probabilistic Model for Molecular Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
An analysis for proving probabilistic termination of biological systems
Theoretical Computer Science
| Hi-index | 0.01 |
Probability features increasingly often in software andhardware systems: it is used in distributed coordinationand routing problems, to model fault-tolerance and performance,and to provide adaptive resource managementstrategies. Probabilistic model checking is an automaticprocedure for establishing if a desired property holds in aprobabilistic model, aimed at verifying probabilistic specificationssuch as "leader election is eventually resolvedwith probability 1", "the chance of shutdown occurring isat most 0.01%", and "the probability that a message willbe delivered within 30ms is at least 0.75". A probabilisticmodel checker calculates the probability of a given temporallogic property being satisfied, as opposed to validity.In contrast to conventional model checkers, which relyon reachability analysis of the underlying transition systemgraph, probabilistic model checking additionally involvesnumerical solutions of linear equations and linear programmingproblems. This paper reports our experience withimplementing PRISM (www.cs.bham.ac.uk/~dxp/prism/), a Probabilistic Symbolic Model Checker, demonstratesits usefulness in analysing real-world probabilisticprotocols, and outlines future challenges for this researchdirection.