{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T21:57:37Z","timestamp":1775512657456,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540705437","type":"print"},{"value":"9783540705451","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70545-1_23","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"240-253","source":"Crossref","is-referenced-by-count":20,"title":["Ranking Automata and Games for Prioritized Requirements"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]},{"given":"Aditya","family":"Kanade","sequence":"additional","affiliation":[]},{"given":"Gera","family":"Weiss","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"23_CR1","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/377978.377990","volume":"2","author":"R. Alur","year":"2001","unstructured":"Alur, R., Etessami, K., Torre, S.L., Peled, D.: Parametric temporal logic for \u201cmodel measuring\u201d. ACM Trans. Comput. Log\u00a02(3), 388\u2013407 (2001)","journal-title":"ACM Trans. Comput. Log"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/978-3-540-27836-8_26","volume-title":"Automata, Languages and Programming","author":"G. Bruns","year":"2004","unstructured":"Bruns, G., Godefroid, P.: Model Checking with Multi-valued Logics. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 281\u2013293. Springer, Heidelberg (2004)"},{"key":"23_CR3","volume-title":"Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications","author":"G. Buttazzo","year":"2000","unstructured":"Buttazzo, G.: Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications. Kluwer Academic Publishers, Boston, USA (2000)"},{"key":"23_CR4","unstructured":"Chatterjee, K.: A linear-time algorithm for weak parity games. Technical Report UCB\/EECS-2006-153, University of California, Berkeley (2006)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"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\u201358 (1991)","DOI":"10.1007\/3-540-55179-4_6"},{"key":"23_CR6","first-page":"995","volume-title":"Handbook of Theoretical Computer Science","author":"E. Emerson","year":"1990","unstructured":"Emerson, E.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 995\u20131072. Elsevier Science Publishers, Amsterdam (1990)"},{"issue":"1-2","key":"23_CR7","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/S0304-3975(00)00034-7","volume":"258","author":"E.A. Emerson","year":"2001","unstructured":"Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model checking for the \u03bc-calculus and its fragments. Theor. Comput. Sci\u00a0258(1-2), 491\u2013522 (2001)","journal-title":"Theor. Comput. Sci"},{"issue":"2","key":"23_CR8","first-page":"68","volume":"12","author":"J.P. Ernits","year":"2005","unstructured":"Ernits, J.P.: Memory arbiter synthesis and verification for a radar memory interface card. Nord. J. Comput\u00a012(2), 68\u201388 (2005)","journal-title":"Nord. J. Comput"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1007\/978-3-540-73420-8_73","volume-title":"Automata, Languages and Programming","author":"H. Gimbert","year":"2007","unstructured":"Gimbert, H., Zielonka, W.: Perfect information stochastic priority games. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 850\u2013861. Springer, Heidelberg (2007)"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Gurevich, Y., Harrington, L.: Trees, automata, and games. In: Proc. 14th Annual ACM Symposium on Theory of Computing, pp. 60\u201365 (1982)","DOI":"10.1145\/800070.802177"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.2307\/2273681","volume":"48","author":"J.R. B\u00fcchi","year":"1983","unstructured":"B\u00fcchi, J.R.: State-strategies for games in F \u03c3\u03b4 \u2009\u2229\u2009G \u03c3\u03b4 . Journal of Symbolic Logic\u00a048, 1171\u20131198 (1983)","journal-title":"Journal of Symbolic Logic"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Lustig, Y.: Lattice automata. In: Proc. 8th Int. Conf. on Verification, Model Checking, and Abstract Interpretation, pp. 199\u2013213 (2007)","DOI":"10.1007\/978-3-540-69738-1_14"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Lustig, Y.: Latticed simulation relations and games. In: Proc. 5th symp. on Aut. Technology for Verification and Analysis, pp. 316\u2013330 (2007)","DOI":"10.1007\/978-3-540-75596-8_23"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proc. 18th IEEE Symposium on Foundations of Computer Science, pp. 46\u201377 (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. 16th ACM Symposium on Principles of Programming Languages (1989)","DOI":"10.1145\/75277.75293"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013191 (1993)","DOI":"10.1109\/ICCAD.1993.580054"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Thomas, W.: On the synthesis of strategies in infinite games. In: Proc. 12th Symp. on Theoretical Aspects of Computer Science, pp. 1\u201313 (1995)","DOI":"10.1007\/3-540-59042-0_57"},{"issue":"1","key":"23_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1092","volume":"115","author":"M.Y. Vardi","year":"1994","unstructured":"Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Inf. Comput.\u00a0115(1), 1\u201337 (1994)","journal-title":"Inf. Comput."},{"key":"23_CR19","unstructured":"Weiss, G.: Optimal scheduler for a memory card. Research report, Dep. of Computer Science and Applied Mathematics, The Weizmann Institue of Science (2002)"},{"issue":"1-2","key":"23_CR20","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U. Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci.\u00a0158(1-2), 343\u2013359 (1996)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70545-1_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:07:37Z","timestamp":1605744457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70545-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705437","9783540705451"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70545-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}