Ranking automata and games for prioritized requirements

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

Volumn 5123 LNCS, Issue , 2008, Pages 240-253

  Alur, Rajeev ^a   Kanade, Aditya ^a   Weiss, Gera ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCEPTANCE CONDITIONS; ACCEPTANCE CRITERIA; COMPUTER AIDED VERIFICATION; DECISION PROBLEMS; FIXPOINTS; INTERNATIONAL CONFERENCES; K VALUES; QUADRATIC TIME; RANKING FUNCTIONS; REACTIVE SYSTEMS; SYMBOLIC ALGORITHMS; SYNTHESIS PROBLEMS; SYSTEM EXECUTIONS;

CHLORINE COMPOUNDS; COLOR; COMPUTATIONAL MECHANICS; COMPUTER AIDED ANALYSIS; GAME THEORY; MAPS; OPTICAL PROJECTORS; OPTICAL PROPERTIES; TRANSLATION (LANGUAGES);

SOFTWARE TESTING;

EID: 48949099058     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70545-1_23     Document Type: Conference Paper

References (20)

1. Alur, R., Etessami, K., Torre, S.L., Peled, D.: Parametric temporal logic for "model measuring". ACM Trans. Comput. Log 2(3), 388-407 (2001)
2. Bruns, G., Godefroid, P.: Model Checking with Multi-valued Logics. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 281-293. Springer, Heidelberg (2004)
3. Buttazzo, G.: Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications. Kluwer Academic Publishers, Boston, USA (2000)
4. Chatterjee, K.: A linear-time algorithm for weak parity games. Technical Report UCB/EECS-2006-153, University of California, Berkeley (2006)
5. Cleaveland, R., Steffen, B.: A linear-time model-checking algorithm for the alternation-free modal mu-calculus. In: Proc. 3rd Conference on Computer Aided Verification, pp. 48-58 (1991)
6. Emerson, E.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 995-1072. Elsevier Science Publishers, Amsterdam (1990)
7. Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model checking for the μ-calculus and its fragments. Theor. Comput. Sci 258(1-2), 491-522 (2001)
8. Ernits, J.P.: Memory arbiter synthesis and verification for a radar memory interface card. Nord. J. Comput 12(2), 68-88 (2005)
9. Gimbert, H., Zielonka, W.: Perfect information stochastic priority games. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 850-861. Springer, Heidelberg (2007)
10. Gurevich, Y., Harrington, L.: Trees, automata, and games. In: Proc. 14th Annual ACM Symposium on Theory of Computing, pp. 60-65 (1982)
11. σδ. Journal of Symbolic Logic 48, 1171-1198 (1983)
12. Kupferman, O., Lustig, Y.: Lattice automata. In: Proc. 8th Int. Conf. on Verification, Model Checking, and Abstract Interpretation, pp. 199-213 (2007)
13. Kupferman, O., Lustig, Y.: Latticed simulation relations and games. In: Proc. 5th symp. on Aut. Technology for Verification and Analysis, pp. 316-330 (2007)
14. Pnueli, A.: The temporal logic of programs. In: Proc. 18th IEEE Symposium on Foundations of Computer Science, pp. 46-77 (1977)
15. Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. 16th ACM Symposium on Principles of Programming Languages (1989)
16. Bahar, R.I., Frohm, E.A., Gaona, C.M., Hachtel, G.D., Macii, E., Pardo, A., Somenzi, F.: Algebraic Decision Diagrams and Their Applications. In: Proc. 9th International Conference on CAD, pp. 188-191 (1993)
17. Thomas, W.: On the synthesis of strategies in infinite games. In: Proc. 12th Symp. on Theoretical Aspects of Computer Science, pp. 1-13 (1995)
18. Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Inf. Comput. 115(1), 1-37 (1994)
19. Weiss, G.: Optimal scheduler for a memory card. Research report, Dep. of Computer Science and Applied Mathematics, The Weizmann Institue of Science (2002)
20. Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci. 158(1-2), 343-359 (1996)