Bisimulation through probabilistic testing
Information and Computation
Probabilistic non-determinism
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Stubborn set methods for process algebras
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Partial order reduction: linear and branching temporal logics and process algebras
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Model Minimization in Hierarchical Reinforcement Learning
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Static Partial Order Reduction
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Temporal Logics for the Specification of Performance and Reliability
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
A Simple Characterization of Stuttering Bisimulation
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
All from One, One for All: on Model Checking Using Representatives
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
A partial order approach to branching time logic model checking
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Partial Order Reduction for Probabilistic Systems
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Partial Order Reduction on Concurrent Probabilistic Programs
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Quantitative analysis of distributed randomized protocols
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Stochastic model checking with stochastic comparison
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Generating Compact MTBDD-Representations from Probmela Specifications
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Performability assessment by model checking of Markov reward models
Formal Methods in System Design
| Hi-index | 0.00 |
In recent papers, the partial order reduction approach has been adapted to reason about the probabilities for temporal properties in concurrent systems with probabilistic behaviours. This paper extends these results by presenting reduction criteria for a probabilistic branching time logic that allows specification of constraints on quantitative measures given by a reward or cost function for the actions of the system.