{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:30:13Z","timestamp":1742380213236},"publisher-location":"Berlin\/Heidelberg","reference-count":19,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032043","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T01:05:31Z","timestamp":1134263131000},"page":"336-349","source":"Crossref","is-referenced-by-count":38,"title":["Markov decision processes and regular events"],"prefix":"10.1007","author":[{"given":"Costas","family":"Courcoubetis","sequence":"first","affiliation":[]},{"given":"Mihalis","family":"Yannakakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"S. Aggarwal, C. Courcoubetis and P. Wolper, \"Adding Liveness Properties to Coupled Finite-State Machines\", AT&T Bell Laboratories Technical Memorandum, to appear in ACM TOPLAS."},{"key":"27_CR2","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0022-247X(85)90288-4","volume":"112","author":"F. Beutler","year":"1985","unstructured":"F. Beutler and K. Ross, \"Optimal Policies for Controlled Markov Chains with a constraint\", J. Math. Analysis and Appl., 112, pp. 236\u2013252, 1985.","journal-title":"J. Math. Analysis and Appl."},{"issue":"2","key":"27_CR3","doi-asserted-by":"crossref","first-page":"341","DOI":"10.2307\/1427303","volume":"18","author":"F. Beutler","year":"1986","unstructured":"F. Beutler and K. Ross, \"Time-Average Optimal Constrained Semi-Markov Decision Processes\", Adv. Applied Prob., 18(2), pp. 341\u2013359, 1986.","journal-title":"Adv. Applied Prob."},{"issue":"3","key":"27_CR4","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1109\/9.402","volume":"33","author":"R. Cieslak","year":"1988","unstructured":"R. Cieslak, C. Desclaux, A. Fawaz and P. Varaiya, \"Supervisory Control of Discrete-Event Processes with Partial Information\", IEEE Trans. on Automatic Control, 33(3), pp. 249\u2013260, March 1988.","journal-title":"IEEE Trans. on Automatic Control"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"C. Courcoubetis and M. Yannakakis, \"Verifying Temporal Properties of Finite-State Probabilistic Programs\", Proc. of 29th FOCS, 1988, pp. 338\u2013345, Oct. 1988.","DOI":"10.1109\/SFCS.1988.21950"},{"key":"27_CR6","volume-title":"Finite-State Markovian Decision Processes","author":"C. Derman","year":"1970","unstructured":"C. Derman, Finite-State Markovian Decision Processes, Academic Press, New York, 1970."},{"key":"27_CR7","volume-title":"Linear Programming and Finite Markovian Control Problems","author":"L.C.M. Kallenberg","year":"1983","unstructured":"L.C.M. Kallenberg, Linear Programming and Finite Markovian Control Problems, Mathematical Center Tracts, Amsterdam, 1983."},{"key":"27_CR8","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"R. McNaughton, \"Testing and Generating Infinite Sequences by a Finite Automaton\", Information and Control, 9(1966), pp. 521\u2013530.","journal-title":"Information and Control"},{"key":"27_CR9","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(81)90110-9","volume":"13","author":"A. Pnueli","year":"1981","unstructured":"A. Pnueli, \"The Temporal Logic of Concurrent Programs\", Theoretical Computer Science 13(1981), pp. 45\u201360.","journal-title":"Theoretical Computer Science"},{"key":"27_CR10","series-title":"Research Report","volume-title":"Fairness and Related Properties in Transition Systems","author":"J. P. Queille","year":"1982","unstructured":"J. P. Queille, J. Sifakis, \"Fairness and Related Properties in Transition Systems\", Research Report #292, IMAG, Grenoble, 1982."},{"key":"27_CR11","first-page":"1","volume":"13","author":"M. O. Rabin","year":"1972","unstructured":"M. O. Rabin, \"Automata on Infinite Objects and Church's Problem\", Proc. Regional AMS Conf. Series in Math. 13(1972), pp. 1\u201322.","journal-title":"Proc. Regional AMS Conf. Series in Math."},{"key":"27_CR12","volume-title":"Introduction to Stochastic Dynamic Programming","author":"S. Ross","year":"1983","unstructured":"S. Ross, Introduction to Stochastic Dynamic Programming, Academic Press, New York, 1983."},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"K. Ross and R. Varadarajan, \"Markov Decision Processes with Sample Path Constraints; the Communicating Case\", to appear in Operations Research, 1990.","DOI":"10.1287\/opre.37.5.780"},{"issue":"1","key":"27_CR14","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1137\/0325013","volume":"25","author":"P. Ramadge","year":"1987","unstructured":"P. Ramadge and W.M. Wonham, \"Supervisory Control of a Class of Discrete-Event Processes\", SIAM J. on Contr. and Optimization, 25(1), pp. 206\u2013230, January 1987.","journal-title":"SIAM J. on Contr. and Optimization"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"S. Safra, \"On the Complexity of \u03c9-automata\", Proc. of 29th FOCS, 1988, pp. 319\u2013327, Oct. 1988.","DOI":"10.1109\/SFCS.1988.21948"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"M. Vardi, \"Automatic Verification of Probabilistic Concurrent Finite-State Programs\", Proc. of 26th STOC, 1985.","DOI":"10.1109\/SFCS.1985.12"},{"key":"27_CR17","unstructured":"M. Vardi and P. Wolper, \"An automata-Theoretic Approach to Automatic Program Verification\", Proc. 1st Symp. on Logic in Computer Science, 1986."},{"issue":"3","key":"27_CR18","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1137\/0325036","volume":"25","author":"W. M. Wonham","year":"1987","unstructured":"W. M. Wonham and P. Ramadge, \"On the Supremal Controllable Sublanguage of a Given Language\", SIAM J. on Contr. and Optimization, 25(3), pp. 637\u2013659, May 1987.","journal-title":"SIAM J. on Contr. and Optimization"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"P. Wolper, M. Y. Vardi, A. P. Sistla, \"Reasoning about Infinite Computation Paths\", Proc. of 24th IEEE Symp. on Foundations of Computer Science, 1983, pp. 185\u2013194.","DOI":"10.1109\/SFCS.1983.51"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032043","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T09:45:14Z","timestamp":1586598314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0032043","relation":{},"subject":[]}}