{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:23:36Z","timestamp":1742912616596,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642156427"},{"type":"electronic","value":"9783642156434"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15643-4_4","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T13:39:39Z","timestamp":1284989979000},"page":"22-36","source":"Crossref","is-referenced-by-count":3,"title":["Promptness in \u03c9-Regular Automata"],"prefix":"10.1007","author":[{"given":"Shaull","family":"Almagor","sequence":"first","affiliation":[]},{"given":"Yoram","family":"Hirshfeld","sequence":"additional","affiliation":[]},{"given":"Orna","family":"Kupferman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B. Alpern","year":"1985","unstructured":"Alpern, B., Schneider, F.B.: Defining liveness. IPL\u00a021, 181\u2013185 (1985)","journal-title":"IPL"},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/377978.377990","volume":"2","author":"R. Alur","year":"2001","unstructured":"Alur, R., Etessami, K., La Torre, S., Peled, D.: Parametric temporal logic for model measuring. ACM Transactions on Computational Logic\u00a02(3), 388\u2013407 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.A.: Finitary fairness. In: Proc. 9th IEEE Symp. on Logic in Computer Science, pp. 52\u201361 (1994)","DOI":"10.1109\/LICS.1994.316087"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M.: A bounding quantifier. In: Proc. 13th Annual Conf. of the European Association for Computer Science Logic, pp. 41\u201355 (2004)","DOI":"10.1007\/978-3-540-30124-0_7"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Colcombet, T.: Bounds in \u03c9-regularity. In: Proc. 21st IEEE Symp. on Logic in Computer Science, pp. 285\u2013296 (2006)","DOI":"10.1109\/LICS.2006.17"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Boker, U., Kupferman, O.: Co-ing B\u00fcchi made tight and helpful. In: Proc. 24th IEEE Symp. on Logic in Computer Science, pp. 245\u2013254 (2009)","DOI":"10.1109\/LICS.2009.32"},{"key":"4_CR7","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. Int. Congress on Logic, Method, and Philosophy of Science, pp. 1\u201312 (1962)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/11691372_17","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Chatterjee","year":"2006","unstructured":"Chatterjee, K., Henzinger, T.A.: Finitary winning in \u03c9-regular games. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.\u00a03920, pp. 257\u2013271. Springer, Heidelberg (2006)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-540-39910-0_14","volume-title":"Verification: Theory and Practice","author":"N. Derahowitz","year":"2004","unstructured":"Derahowitz, N., Jayasimha, D.N., Park, S.: Bounded fairness. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol.\u00a02772, pp. 304\u2013317. Springer, Heidelberg (2004)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-540-71209-1_36","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F. Horn","year":"2007","unstructured":"Horn, F.: Faster algorithms for finitary games. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 472\u2013484. Springer, Heidelberg (2007)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","volume":"11","author":"N.D. Jones","year":"1975","unstructured":"Jones, N.D.: Space-bounded reducibility among combinatorial problems. Journal of Computer and Systems Science\u00a011, 68\u201375 (1975)","journal-title":"Journal of Computer and Systems Science"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/3-540-58325-4_202","volume-title":"Algorithms and Computation","author":"S.C. Krishnan","year":"1994","unstructured":"Krishnan, S.C., Puri, A., Brayton, R.K.: Deterministic \u03c9-automata vis-a-vis deterministic B\u00fcchi automata. In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol.\u00a0834, pp. 378\u2013386. Springer, Heidelberg (1994)"},{"issue":"4","key":"4_CR13","first-page":"869","volume":"17","author":"O. Kupferman","year":"2006","unstructured":"Kupferman, O., Morgenstern, G., Murano, A.: Typeness for \u03c9-regular automata. IJFCS\u00a017(4), 869\u2013884 (2006)","journal-title":"IJFCS"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/11817963_6","volume-title":"Computer Aided Verification","author":"O. Kupferman","year":"2006","unstructured":"Kupferman, O., Piterman, N., Vardi, M.Y.: Safraless compositional synthesis. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 31\u201344. Springer, Heidelberg (2006)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-540-73368-3_44","volume-title":"Computer Aided Verification","author":"O. Kupferman","year":"2007","unstructured":"Kupferman, O., Piterman, N., Vardi, M.Y.: From liveness to promptness. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 406\u2013419. Springer, Heidelberg (2007)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/3-540-61474-5_84","volume-title":"Computer Aided Verification","author":"O. Kupferman","year":"1996","unstructured":"Kupferman, O., Vardi, M.Y.: Verification of fair transition systems. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, pp. 372\u2013382. Springer, Heidelberg (1996)"},{"key":"4_CR17","volume-title":"Computer Aided Verification of Coordinating Processes","author":"R.P. Kurshan","year":"1994","unstructured":"Kurshan, R.P.: Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, Princeton (1994)"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/BF01691063","volume":"3","author":"L.H. Landweber","year":"1969","unstructured":"Landweber, L.H.: Decision problems for \u03c9\u2013automata. Mathematical Systems Theory\u00a03, 376\u2013384 (1969)","journal-title":"Mathematical Systems Theory"},{"issue":"1","key":"4_CR19","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. Information and Computation\u00a0115(1), 1\u201337 (1994)","journal-title":"Information and Computation"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/11539452_41","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"T. Margaria","year":"2005","unstructured":"Margaria, T., Sistla, A.P., Steffen, B., Zuck, L.D.: Taming interface specifications. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 548\u2013561. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15643-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T23:05:47Z","timestamp":1740524747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15643-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642156427","9783642156434"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15643-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}