Deciding simulations on probabilistic automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4762 LNCS, Issue , 2007, Pages 207-222

  Zhang, Lijun ^a   Hermanns, Holger ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECISION MAKING; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS;

CONTINUOUS-TIME SETTING; PROBABILISTIC AUTOMATA; PROBABILISTIC SIMULATION;

PROBABILITY;

EID: 38149001514     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75596-8_16     Document Type: Conference Paper

References (15)

1. Baier, C.: On Algorithmic Verification Methods for Probabilistic Systems, Habilitations-schrift zur Erlangung der venia legendi der Fakultät für Mathematik and Informatik, Universität Mannheim (1998)
2. Baier, C., Engelen, B., Majster-Cederbaum, M.E.: Deciding bisimilarity and similarity for probabilistic processes. J. Comput. Syst. Sci. 60(1), 187-231 (2000)
3. Baier, C., Hermanns, H., Katoen, J.-P., Haverkort, B.R.: Efficient computation of time-bounded reachability probabilities in uniform continuous-time markov decision processes. Theor. Comput. Sci. 345(1), 2-26 (2005)
4. Baier, C., Katoen, J.-P., Hermanns, H., Wolf, V.: Comparative branching-time semantics for markov chains. Inf. Comput 200(2), 149-214 (2005)
5. Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
6. Cattani, S., Segala, R.: Decision algorithms for probabilistic bisimulation. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 371-385. Springer, Heidelberg (2002)
7. Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications, SIAM J. Comput. 18(1), 30-55 (1989)
8. Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM 35(4), 921-940 (1988)
9. Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. LICS, pp. 266-277 (1991)
10. Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94(1), 1-28 (1991)
11. Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, Chichester (1994)
12. Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)
13. Segala, R., Lynch, N.A.: Probabilistic simulations for probabilistic processes. Nord. J. Comput. 2(2), 250-273 (1995)
14. Wolovick, N., Johr, S.: A characterization of meaningful schedulers for continuoustime markov decision processes. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 352-367. Springer, Heidelberg (2006)
15. Zhang, L., Hermanns, H., Eisenbrand, F., Jansen, D.N.: Flow faster: Efficient decision algorithms for probabilistic simulations. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 155-169. Springer, Heidelberg (2007)