Flow faster: Efficient decision algorithms for probabilistic simulations

Logical Methods in Computer Science

Volumn 4, Issue 4, 2008, Pages

  Zhang, Lijun ^a   Hermanns, Holger ^a   Eisenbrand, Friedrich ^a   Jansen, David N ^b,c  

^a EPFL   (Switzerland)

^b RWTH AACHEN UNIVERSITY   (Germany)

^c RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

Decision algorithms; Markov chains; Parametric maximum flow; Strong and weak simulation

Indexed keywords

DECISION ALGORITHMS; NON-PROBABILISTIC; PARAMETRIC MAXIMUM FLOW; POLYNOMIAL COMPLEXITY; PROBABILISTIC AUTOMATA; PROBABILISTIC SIMULATION; SIMULATION RELATION; STRONG- AND WEAK-SIMULATION;

ALGORITHMS; AUTOMATA THEORY; CONTINUOUS TIME SYSTEMS; MARKOV PROCESSES; CHAINS; PROBABILISTIC LOGICS;

PARAMETER ESTIMATION;

EID: 77949800255     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-4(4:6)2008     Document Type: Article

References (45)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: theory, algorithms, and applications. Prentice Hall, 1993.
2. R. K. Ahuja, J. B. Orlin, C. Stein, and R. E. Tarjan. Improved algorithms for bipartite network flow. SIAM J. Comput., 23(5): 906-933, 1994.
3. C. Baier, B. Engelen, and M. E. Majster-Cederbaum. Deciding bisimilarity and similarity for probabilistic processes. J. Comput. Syst. Sci., 60(1): 187-231, 2000.
4. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model-checking algorithms for continuous-time Markov chains. IEEE Trans. Software Eng., 29(6): 524-541, 2003.
5. C. Baier and H. Hermanns. Weak bisimulation for fully probabilistic processes. In Computer Aided Verification, volume 1254 of LNCS, pages 119-130. Springer, 1997.
6. C. Baier, H. Hermanns, and J.-P. Katoen. Probabilistic weak simulation is decidable in polynomial time. Information processing letters, 89(3): 123-130, 2004.
7. C. Baier, H. Hermanns, J.-P. Katoen, and B. R. Haverkort. Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes. Theor. Comput. Sci., 345(1): 2-26, 2005.
8. C. Baier, J.-P. Katoen, H. Hermanns, and B. Haverkort. Simulation for continuous-time Markov chains. In Concurrency, volume 2421 of LNCS, pages 338-354. Springer, 2002.
9. C. Baier, J.-P. Katoen, H. Hermanns, and V. Wolf. Comparative branching-time semantics for Markov chains. Information and computation, 200(2): 149-214, 2005.
10. B. Bloom and R. Paige. Transformational design and implementation of a new efficient solution to the ready simulation problem. Sci. Comput. Program., 24(3): 189-220, 1995.
11. H. C. Bohnenkamp, P. van der Stok, H. Hermanns, and F. W. Vaandrager. Cost-optimization of the IPv4 zeroconf protocol. In Dependable Systems and Networks, pages 531-540. IEEE Computer Society, 2003.
12. S. Cattani and R. Segala. Decision algorithms for probabilistic bisimulation. In Concurrency, volume 2421 of LNCS, pages 371-385. Springer, 2002.
13. K. Chatterjee, L. de Alfaro, R. Majumdar, and V. Raman. Algorithms for game metrics (full version). In Foundations of Software Technology and Theoretical Computer Science, 2008.
14. J. Cheriyan, T. Hagerup, and K. Mehlhorn. Can a maximum flow be computed in O(nm) time? In Automata, languages and programming, volume 443 of LNCS, pages 235-248. Springer, 1990.
15. J. Cheriyan and K. Mehlhorn. An analysis of the highest-level selection rule in the preflow-push maxflow. Inf. Process. Lett., 69(5): 239-242, 1999.
16. E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5): 1512-1542, 1994.
17. S. Derisavi, H. Hermanns, and W. H. Sanders. Optimal State-Space Lumping in Markov Chains. Inf. Process. Lett., 87(6): 309-315, 2003.
18. G. Gallo, M. D. Grigoriadis, and R. E. Tarjan. A fast parametric maximum flow algorithm and applications. SIAM J. Comput., 18(1): 30-55, 1989.
19. A. V. Goldberg. Recent developments in maximum flow algorithms. In Scandinavian Workshop on Algorithm Theory, volume 1432 of LNCS, pages 1-10. Springer, 1998.
20. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum-flow problem. J. ACM, 35(4): 921-940, 1988.
21. C. Groß, H. Hermanns, and R. Pulungan. Does clock precision influence zigbee's energy consumptions? In International Conference on Principles of Distributed Systems, volume 4878 of LNCS, pages 174-188. Springer, 2007.
22. D. Gusfield and É. Tardos. A faster parametric minimum-cut algorithm. Algorithmica, 11(3): 278-290, 1994.
23. M. R. Henzinger, T. A. Henzinger, and P. W. Kopke. Computing simulations on finite and infinite graphs. In Foundations of Computer Science, pages 453-462. IEEE Computer Society, 1995.
24. H. Hermanns. Interactive Markov Chains: The Quest for Quantified Quality, volume 2428 of LNCS. Springer, 2002.
25. D. T. Huynh and L. Tian. On some equivalence relations for probabilistic processes. Fundam. Inform., 17(3): 211-234, 1992.
26. B. Jonsson and K. G. Larsen. Specification and refinement of probabilistic processes. In Logic in Computer Science, pages 266-277. IEEE Computer Society, 1991.
27. N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4(4): 373-396, 1984.
28. V. King, S. Rao, and R. E. Tarjan. A faster deterministic maximum flow algorithm. J. Algorithms, 17(3): 447-474, 1994.
29. R. Knast. Continuous-time probabilistic automata. Information and Control, 15(4): 335-352, 1969.
30. K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1): 1-28, 1991.
31. S. Mangold, Z. Zhong, G. R. Hiertz, and B. Walke. IEEE 802. 11e/802. 11k wireless LAN: spectrum awareness for distributed resource sharing. Wireless Communications and Mobile Computing, 4(8): 881-902, 2004.
32. M. A. Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis. Modelling with generalized stochastic petri nets. SIGMETRICS Performance Evaluation Review, 26(2): 2, 1998.
33. R. Milner. An algebraic definition of simulation between programs. In IJCAI, pages 481-489, 1971.
34. R. Milner. A Calculus of Communicating Systems, volume 92 of LNCS. Springer, 1980.
35. D. Park. Concurrency and automata on infinite sequences. In Theor. Comput. Sci., pages 167-183, 1981.
36. M. L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York, 1994.
37. W. H. Sanders and J. F. Meyer. Reduced base model construction methods for stochastic activity networks. IEEE Journal on Selected Areas in Communications, 9(1): 25-36, 1991.
38. A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1986.
39. R. Segala. Modeling and Verification of Randomized Distributed Realtime Systems. PhD thesis, MIT, 1995.
40. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2): 250-273, 1995.
41. W. J. Steward. Introduction to the Numerical Solution of Markov Chains. Princeton University Press, 1994.
42. N. Wolovick and S. Johr. A characterization of meaningful schedulers for continuous-time Markov decision processes. In Formal Modeling and Analysis of Timed Systems, volume 4202 of LNCS, pages 352-367. Springer, 2006.
43. L. Zhang. Decision Algorithms for Probabilistic Simulations. PhD thesis, Universität des Saarlandes, 2008.
44. L. Zhang and H. Hermanns. Deciding simulations on probabilistic automata. In Automated Technology for Verification and Analysis, volume 4762 of LNCS, pages 207-222. Springer, 2007.
45. L. Zhang, H. Hermanns, F. Eisenbrand, and D. N. Jansen. Flow faster: Efficient decision algorithms for probabilistic simulations. In Tools and Algorithms for the Construction and Analysis of Systems, volume 4424 of LNCS, pages 155-169. Springer, 2007.