A space-efficient probabilistic simulation algorithm

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

Volumn 5201 LNCS, Issue , 2008, Pages 248-263

  Zhang, Lijun ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS;

COMPUTING; EFFICIENT; EFFICIENT ALGORITHMS; EXPERIMENTAL EVIDENCES; ORDERS OF MAGNITUDES; PARTITION REFINEMENTS; PRACTICAL; PROBABILISTIC AUTOMATON; PROBABILISTIC SIMULATIONS; SPACE COMPLEXITIES; SPACE REQUIREMENTS; TIME EFFICIENT ALGORITHMS; TRANSITION RELATIONS;

PROBABILITY;

EID: 54249098652     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85361-9_22     Document Type: Conference Paper

References (17)

1. Baier, C., Engelen, B., Majster-Cederbaum, M.E.: Deciding bisimilarity and similarity for probabilistic processes. J. Comput. Syst. Sci. 60(1), 187-231 (2000)
2. Bogdoll, J., Hermanns, H., Zhang, L.: An experimental evaluation of probabilistic simulation. In: Suzuki, K., Higashino, T., Yasumoto, K., El-Fakih, K. (eds.) FORTE 2008. LNCS, vol. 5048, pp. 37-52. Springer, Heidelberg (2008)
3. Bustan, D., Grumberg, O.: Simulation based minimization. In: McAllester, D. (ed.) CADE 2000. LNCS, vol. 1831, pp. 255-270. Springer, Heidelberg (2000)
4. Courcoubetis, C., Vardi, M.Y., Wolper, P., Yannakakis, M.: Memory effcient algorithms for the verification of temporal properties. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol. 531, pp. 233-242. Springer, Heidelberg (1991)
5. Gallo, G., Grigoriadis, M., Tarjan, R.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18(1), 30-55 (1989)
6. Gentilini, R., Piazza, C., Policriti, A.: From bisimulation to simulation: Coarsest partition problems. J. Autom. Reasoning 31(1), 73-103 (2003)
7. Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: FOCS, pp. 453-462 (1995)
8. Jonsson, B., Larsen, K.: Specification and refinement of probabilistic processes. In: LICS, pp. 266-277 (1991)
9. Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)
10. Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973-989 (1987)
11. Ranzato, F., Tapparo, F.: A new effcient simulation equivalence algorithm. In: LICS, pp. 171-180 (2007)
12. Segala, R., Lynch, N.A.: Probabilistic simulations for probabilistic processes. Nord. J. Comput. 2(2), 250-273 (1995)
13. Tan, L., Cleaveland, R.: Simulation revisited. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 480-495. Springer, Heidelberg (2001)
14. van Glabbeek, R.J., Ploeger, B.: Correcting a space-effcient simulation algorithm. In: CAV 2008 (to appear, 2008)
15. Zhang, L.: Decision Algorithms for Probabilistic Simulations. PhD thesis, Universit ätm des Saarlandes (2008)
16. Zhang, L., Hermanns, H.: Deciding simulations on probabilistic automata. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol. 4762, pp. 207-222. Springer, Heidelberg (2007)
17. Zhang, L., Hermanns, H., Eisenbrand, F., Jansen, D.N.: Flow faster: Effcient decision algorithms for probabilistic simulations. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 155-169. Springer, Heidelberg (2007)