{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T07:18:41Z","timestamp":1775027921734,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540763352","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76336-9_7","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T05:44:48Z","timestamp":1193463888000},"page":"51-61","source":"Crossref","is-referenced-by-count":24,"title":["On-the-Fly Stuttering in the Construction of Deterministic \u03c9-Automata"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Klein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christel","family":"Baier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume":"3","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. Handbook of formal languages\u00a03, 389\u2013455 (1997)","journal-title":"Handbook of formal languages"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Automata Logics, and Infinite Games: A Guide to Current Research","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"key":"7_CR3","first-page":"332","volume-title":"LICS","author":"M.Y. Vardi","year":"1986","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: LICS, pp. 332\u2013344. IEEE Computer Society Press, Los Alamitos (1986)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/3-540-60915-6_6","volume-title":"Logics for Concurrency","author":"M.Y. Vardi","year":"1996","unstructured":"Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol.\u00a01043, pp. 238\u2013266. Springer, Heidelberg (1996)"},{"key":"7_CR5","first-page":"46","volume-title":"FOCS","author":"A. Pnueli","year":"1977","unstructured":"Pnueli, A.: The temporal logic of programs. In: FOCS, pp. 46\u201357. IEEE Computer Society Press, Los Alamitos (1977)"},{"key":"7_CR6","unstructured":"de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, Department of Computer Science (1997)"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s004460050046","volume":"11","author":"C. Baier","year":"1998","unstructured":"Baier, C., Kwiatkowska, M.: Model checking for a probabilistic branching time logic with fairness. Distributed Computing\u00a011, 125\u2013155 (1998)","journal-title":"Distributed Computing"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/3-540-48778-6_16","volume-title":"Formal Methods for Real-Time and Probabilistic Systems","author":"M. Vardi","year":"1999","unstructured":"Vardi, M.: Probabilistic linear-time model checking: An overview of the automata-theoretic approach. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol.\u00a01601, pp. 265\u2013276. Springer, Heidelberg (1999)"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.tcs.2006.07.022","volume":"363","author":"J. Klein","year":"2006","unstructured":"Klein, J., Baier, C.: Experiments with deterministic \u03c9-automata for formulas of linear temporal logic. Theoretical Computer Science\u00a0363, 182\u2013195 (2006)","journal-title":"Theoretical Computer Science"},{"key":"7_CR10","unstructured":"Safra, S.: Complexity of Automata on Infinite Objects. PhD thesis, The Weizmann Institute of Science, Rehovot, Israel (1989)"},{"key":"7_CR11","first-page":"131","volume-title":"QEST","author":"F. Ciesinski","year":"2006","unstructured":"Ciesinski, F., Baier, C.: LiQuor: A tool for qualitative and quantitative linear time analysis of reactive systems. In: QEST, pp. 131\u2013132. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Lamport, L.: What Good is Temporal Logic? In: IFIP Congress, pp. 657\u2013668 (1983)","DOI":"10.1145\/2402.322398"},{"key":"7_CR13","first-page":"197","volume-title":"FORTE","author":"G.J. Holzmann","year":"1994","unstructured":"Holzmann, G.J., Peled, D.: An improvement in formal verification. In: FORTE, pp. 197\u2013211. Chapman & Hall, Sydney, Australia (1994)"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF00709154","volume":"1","author":"A. Valmari","year":"1992","unstructured":"Valmari, A.: A stubborn attack on state explosion. Formal Methods in System Design\u00a01, 297\u2013322 (1992)","journal-title":"Formal Methods in System Design"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.entcs.2005.10.034","volume":"153","author":"C. Baier","year":"2006","unstructured":"Baier, C., D\u2019Argenio, P.R., Gr\u00f6\u00dfer, M.: Partial order reduction for probabilistic branching time. Electr. Notes Theor. Comput. Sci.\u00a0153, 97\u2013116 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-48683-6_22","volume-title":"Computer Aided Verification","author":"K. Etessami","year":"1999","unstructured":"Etessami, K.: Stutter-invariant languages, omega-automata, and temporal logic. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 236\u2013248. Springer, Heidelberg (1999)"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0020-0190(97)00133-6","volume":"63","author":"D. Peled","year":"1997","unstructured":"Peled, D., Wilke, T.: Stutter-invariant temporal properties are expressible without the next-time operator. Inf. Process. Lett.\u00a063, 243\u2013246 (1997)","journal-title":"Inf. Process. Lett."},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(97)00219-3","volume":"195","author":"D. Peled","year":"1998","unstructured":"Peled, D., Wilke, T., Wolper, P.: An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and omega-Regular Languages. Theor. Comput. Sci.\u00a0195, 183\u2013203 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR19","unstructured":"Holzmann, G., Kupferman, O.: Not checking for closure under stuttering. In: Proceedings of the 2nd International Workshop on the SPIN Verification System, DIMCAS, pp. 163\u2013169 (1996)"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0020-0190(00)00113-7","volume":"75","author":"K. Etessami","year":"2000","unstructured":"Etessami, K.: A note on a question of Peled and Wilke regarding stutter-invariant LTL. Inf. Process. Lett.\u00a075, 261\u2013263 (2000)","journal-title":"Inf. Process. Lett."},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/3-540-44585-4_6","volume-title":"Computer Aided Verification","author":"P. Gastin","year":"2001","unstructured":"Gastin, P., Oddoux, D.: Fast LTL to B\u00fcchi automata translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 53\u201365. Springer, Heidelberg (2001)"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-44618-4_13","volume-title":"CONCUR 2000 - Concurrency Theory","author":"K. Etessami","year":"2000","unstructured":"Etessami, K., Holzmann, G.J.: Optimizing B\u00fcchi automata. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 153\u2013167. Springer, Heidelberg (2000)"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/10722167_21","volume-title":"Computer Aided Verification","author":"F. Somenzi","year":"2000","unstructured":"Somenzi, F., Bloem, R.: Efficient B\u00fcchi automata from LTL formulae. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 248\u2013263. Springer, Heidelberg (2000)"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Dwyer, M.B., Avrunin, G.S., Corbett, J.C.: Patterns in property specifications for finite-state verification. In: ICSE, pp. 411\u2013420 (1999)","DOI":"10.1145\/302405.302672"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76336-9_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:48:16Z","timestamp":1619520496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76336-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540763352"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76336-9_7","relation":{},"subject":[]}}