On Omega-Languages Defined by Mean-Payoff Conditions-Reference-Cited by-同舟云学术

On Omega-Languages Defined by Mean-Payoff Conditions

Published:2009 Issue: Volume: Page:333-347
ISSN:0302-9743
Container-title:Foundations of Software Science and Computational Structures
language:
Short-container-title:

Author:

Alur Rajeev,Degorre Aldric,Maler Oded,Weiss Gera

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-00596-1_24

Reference12 articles.

1. Lecture Notes in Computer Science;R. Alur,2008

2. Chatterjee, K.: Concurrent games with tail objectives. Theor. Comput. Sci. 388(1-3), 181–198 (2007)

3. Chatterjee, K., de Alfaro, L., Henzinger, T.: The complexity of quantitative concurrent parity games. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, pp. 678–687 (2006)

4. Lecture Notes in Computer Science;K. Chatterjee,2008

5. Chatterjee, K., Henzinger, T., Jurdziński, M.: Mean-payoff parity games. In: Proceedings of the 20th Annual Symposium on Logic in Computer Science, pp. 178–187. IEEE Computer Society Press, Los Alamitos (2005)

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Comparator Automata in Quantitative Verification;Lecture Notes in Computer Science;2018

2. The Multiple Dimensions of Mean-Payoff Games;Lecture Notes in Computer Science;2017

3. Measuring and Synthesizing Systems in Probabilistic Environments;Journal of the ACM;2015-03-02

4. Pareto Curves of Multidimensional Mean-Payoff Games;Computer Aided Verification;2015

5. Robust Multidimensional Mean-Payoff Games are Undecidable;Lecture Notes in Computer Science;2015