A new approach to the maximum-flow problem
Journal of the ACM (JACM)
A fast parametric maximum flow algorithm and applications
SIAM Journal on Computing
Deciding bisimilarity and similarity for probabilistic processes
Journal of Computer and System Sciences
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Simulation for Continuous-Time Markov Chains
CONCUR '02 Proceedings of the 13th 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
Verifying Continuous Time Markov Chains
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Wireless Communications & Mobile Computing - Special Issue: Emerging WLAN Apllications and Technologies
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Comparative branching-time semantics for Markov chains
Information and Computation
Bisimulation minimisation mostly speeds up probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Flow faster: efficient decision algorithms for probabilistic simulations
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Deciding simulations on probabilistic automata
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Does clock precision influence ZigBee's energy consumptions?
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Experimental evaluation of classical automata constructions
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
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
A Space-Efficient Probabilistic Simulation Algorithm
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
| Hi-index | 0.00 |
Probabilisticmodel checking has emerged as a versatile system verification approach, but is frequently facing state-space explosion problems. One promising attack to this is to construct an abstract model which simulatesthe original model, and to perform model checking on that abstract model. Recently, efficient algorithms for deciding simulation of probabilistic models have been proposed. They reduce the theoretical complexity bounds drastically by exploiting parametric maximum flow algorithms. In this paper, we report on experimental comparisons of these algorithms, together with various interesting optimizations. The evaluation is carried out on both standard PRISM example cases as well as randomly generated models. The results show interesting time-space tradeoffs, with the parametric maximum flow algorithms being superior for large, dense models.