Pang, Jun ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
External co-authors :
yes
Language :
English
Title :
On probabilistic alternating simulations
Publication date :
2010
Event name :
6th IFIP Conference on Theoretical Computer Science
Event date :
2010
Audience :
International
Main work title :
Proc. 6th IFIP Conference on Theoretical Computer Science
Publisher :
IFIP International Federation for Information Processing
Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. In: Proc. FOCS, pp. 100-109. IEEE CS, Los Alamitos (1997)
Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5), 672-713 (2002)
Alur, R., Henzinger, T.A., Kupferman, O., Vardi, M.Y.: Alternating refinement relations. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 163-178. Springer, Heidelberg (1998)
Aizatulin, M., Schnoor, H., Wilke, T.: Computationally sound analysis of a probabilistic contract signing protocol. In: Backes, M., Ning, P. (eds.) ESORICS 2009. LNCS, vol. 5789, pp. 571-586. Springer, Heidelberg (2009)
Baier, C., Engelen, B., Majster-Cederbaum, M.E.: Deciding bisimilarity and similarity for probabilistic processes. J. Comput. Syst. Sci. 60(1), 187-231 (2000)
Chatterjee, K., de Alfaro, L., Henzinger, T.A.: The complexity of quantitative concurrent parity games. In: Proc. SODA, pp. 678-687. ACM, New York (2006)
Chen, T., Lu, J.: Probabilistic alternating-time temporal logic and model checking algorithm. In: Proc. FSKD, pp. 35-39. IEEE CS, Los Alamitos (2007)
de Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent reachability games. In: Proc. FOCS, pp. 564-575. IEEE CS, Los Alamitos (1998)
de Alfaro, L., Majumdar, R.: Quantitative solution of omega-regular games. J. Comput. Syst. Sci. 68(2), 374-397 (2004)
Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Weak bisimulation is sound and complete for PCTL[1]. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 355-370. Springer, Heidelberg (2002)
Emerson, E.A.: Temporal and modal logic. In: Handbook of Theoretical Computer Science (B), pp. 955-1072. MIT Press, Cambridge (1990)
Hansson, H.: Time and Probability in Formal Design of Distributed Systems. Elsevier, Amsterdam (1994)
Lynch, N.A., Segala, R., Vaandrager, F.W.: Observing branching structure through probabilistic contexts. SIAM J. Comput. 37(4), 977-1013 (2007)
Martin, D.A.: The determinacy of Blackwell games. J. Symb. Log. 63(4), 1565-1581 (1998)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1947)
Parma, A., Segala, R.: Logical characterizations of bisimulations for discrete probabilistic systems. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 287-301. Springer, Heidelberg (2007)
Raghavan, T.E.S., Filar, J.A.: Algorithms for stochastic games - A survey. Mathematical Methods of Operations Research 35(6), 437-472 (1991)
Segala, R.: A compositional trace-based semantics for probabilistic automata. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 234-248. Springer, Heidelberg (1995)
Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT (1995)
Segala, R., Lynch, N.A.: Probabilistic simulations for probabilistic processes. Nord. J. Comput. 2(2), 250-273 (1995)
Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science (B), pp. 133-192. MIT Press, Cambridge (1990)
