Stochastic Parity Games on Lossy Channel Systems

We give an algorithm for solving stochastic parity games with almost-sure winning conditions on lossy channel systems, under the constraint that both players are restricted to finitememory strategi ...

[1]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

[2]  Parosh Aziz Abdulla,et al.  Algorithmic Analysis of Programs with Well Quasi-ordered Domains , 2000, Inf. Comput..

[3]  Zhibin Jiang,et al.  Queueing system with impatient customers: A review , 2010, Proceedings of 2010 IEEE International Conference on Service Operations and Logistics, and Informatics.

[4]  Thomas A. Henzinger,et al.  Concurrent omega-regular games , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[5]  P. Abdulla,et al.  Edinburgh Stochastic Parity Games on Lossy Channel Systems , 2013 .

[6]  Patrick Billingsley,et al.  Probability and Measure. , 1986 .

[7]  Parosh Aziz Abdulla,et al.  Undecidable Verification Problems for Programs with Unreliable Channels , 1994, Inf. Comput..

[8]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

[9]  Parosh Aziz Abdulla,et al.  Monotonic and Downward Closed Games , 2008, J. Log. Comput..

[10]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[11]  Alexander Moshe Rabinovich,et al.  Quantitative Analysis of Probabilistic Lossy Channel Systems , 2003, ICALP.

[12]  Parosh Aziz Abdulla,et al.  Verifying Programs with Unreliable Channels , 1996, Inf. Comput..

[13]  Parosh Aziz Abdulla,et al.  Deciding Monotonic Games , 2003, CSL.

[14]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[15]  Alain Finkel,et al.  Decidability of the termination problem for completely specified protocols , 1994, Distributed Computing.

[16]  Philippe Schnoebelen,et al.  Verifying lossy channel systems has nonprimitive recursive complexity , 2002, Inf. Process. Lett..

[17]  Philippe Schnoebelen.  Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems , 2001, TACS.

[18]  Krishnendu Chatterjee,et al.  Simple Stochastic Parity Games , 2003, CSL.

[19]  Nathalie Bertrand,et al.  uchi Games on Infinite Arenas with a Finite Attractor , 2012, 1207.4577.

[20]  Stephan Merz,et al.  Model Checking , 2000 .

[21]  Richard Mayr.  Undecidable problems in unreliable computations , 2003, Theor. Comput. Sci..

[22]  Anne Condon,et al.  The Complexity of Stochastic Games , 1992, Inf. Comput..

[23]  Krishnendu Chatterjee,et al.  Strategy Improvement for Concurrent Reachability Games , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[24]  Parosh Aziz Abdulla,et al.  Verification of Probabilistic Systems with Faulty Communication , 2003, FoSSaCS.

[25]  Kousha Etessami,et al.  Recursive Concurrent Stochastic Games , 2008, Log. Methods Comput. Sci..

[26]  J. Norris.  Appendix: probability and measure , 1997 .

[27]  Kousha Etessami,et al.  Recursive Stochastic Games with Positive Rewards , 2008, ICALP.

[28]  W. Marsden.  I and J , 2012 .

[29]  Kousha Etessami,et al.  Recursive Markov Decision Processes and Recursive Stochastic Games , 2005, ICALP.

[30]  Alexander Moshe Rabinovich.  Quantitative analysis of probabilistic lossy channel systems , 2006, Inf. Comput..

[31]  Thomas A. Henzinger,et al.  Concurrent reachability games , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[32]  SchnoebelenPh..  Verifying lossy channel systems has nonprimitive recursive complexity , 2002 .

[33]  Thomas A. Henzinger,et al.  Concurrent reachability games , 2007, Theor. Comput. Sci..

[34]  Parosh Aziz Abdulla,et al.  Decisive Markov Chains , 2007, Log. Methods Comput. Sci..

[35]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

[36]  Nathalie Bertrand,et al.  Model Checking Lossy Channels Systems Is Probably Decidable , 2003, FoSSaCS.

[37]  Parosh Aziz Abdulla,et al.  Stochastic Games with Lossy Channels , 2008, FoSSaCS.

[38]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[39]  Christel Baier,et al.  Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties , 2005, TOCL.