{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,15]],"date-time":"2026-09-15T23:22:16Z","timestamp":1789514536987,"version":"build-2803163510"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"7-8","license":[{"start":{"date-parts":[[2005,5,24]],"date-time":"2005-05-24T00:00:00Z","timestamp":1116892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2005,6]]},"DOI":"10.1007\/s00236-005-0164-4","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T16:42:52Z","timestamp":1117039372000},"page":"415-434","source":"Crossref","is-referenced-by-count":12,"title":["The stuttering principle revisited"],"prefix":"10.1007","volume":"41","author":[{"given":"Anton\u00edn","family":"Ku\u010dera","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan","family":"Strej\u010dek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"164_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(85)90148-3","volume":"39","author":"A. Arnold","year":"1985","unstructured":"Arnold, A.: A syntactical congruence for rational \u03c9-languages. Theor. Comput. Sci. 39, 333\u2013335 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"164_CR2","doi-asserted-by":"crossref","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 on stutter-invariant LTL. Inform. Process. Lett. 75(6), 261\u2013263 (2000)","journal-title":"Inform. Process. Lett."},{"key":"164_CR3","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1006\/inco.1999.2846","volume":"160","author":"K. Etessami","year":"2000","unstructured":"Etessami, K., Wilke, Th.: An until hierarchy and other applications of an Ehrenfeucht-Fra\u00efss\u00e9 game for temporal logic. Inform. Comput. 160, 88\u2013108 (2000)","journal-title":"Inform. Comput."},{"key":"164_CR4","doi-asserted-by":"crossref","unstructured":"Gabbay, D., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. In: Conference Record of the 7th ACM Symposium on Principles of Programming Languages, pp. 163\u2013173. ACM Press (1980)","DOI":"10.1145\/567446.567462"},{"key":"164_CR5","volume-title":"Tense Logic and the Theory of Linear Order. Ph.D. Thesis","author":"J.A.W. Kamp","year":"1968","unstructured":"Kamp, J.A.W.: Tense Logic and the Theory of Linear Order. Ph.D. Thesis, University of California, Los Angeles (1968)"},{"key":"164_CR6","doi-asserted-by":"crossref","unstructured":"Ku\u010dera, A., Strej\u010dek, J.: The stuttering principle revisited: On the expressiveness of nested X and U operators in the logic LTL. In: Bradfield, J. (ed.) CSL\u201902: 11th Annual Conference of the European Association for Computer Science Logic, vol. 2471 of Lecture Notes in Computer Science, pp. 276\u2013291. Springer-Verlag (2002)","DOI":"10.1007\/3-540-45793-3_19"},{"key":"164_CR7","unstructured":"Ku\u010dera, A., Strej\u010dek, J.: An effective characterization of properties definable by LTL formulae with a bounded nesting depth of the next-time operator. Technical Report FIMU-RS-2004-4, Faculty of Informatics, Masaryk University Brno (2004)"},{"key":"164_CR8","unstructured":"Lamport, L.: What good is temporal logic? In: Mason, R.E.A. (ed.) Proceedings of the IFIP Congress on Information Processing, pp. 657\u2013667. Amsterdam, North-Holland (1983)"},{"issue":"5","key":"164_CR9","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0020-0190(97)00133-6","volume":"63","author":"D. Peled","year":"1997","unstructured":"Peled, D., Wilke, Th.: Stutter-invariant temporal properties are expressible without the next-time operator. Inform. Process. Lett. 63(5), 243\u2013246 (1997)","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"164_CR10","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0304-3975(97)00219-3","volume":"195","author":"D. Peled","year":"1998","unstructured":"Peled, D., Wilke, Th., Wolper, P.: An algorithmic approach for checking closure properties of \u03c9-regular languages. Theor. Comput. Sci. 195(2), 183\u2013203 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"164_CR11","doi-asserted-by":"crossref","unstructured":"Perrin, D.: Recent results on automata and infinite words. In: Chytil, M.P., Koubek, V. (ed.) Proceedings of the 11th Symposium on Mathematical Foundations of Computer Science, vol. 176 of Lecture Notes in Computer Science, pp. 134\u2013148. Springer (1984)","DOI":"10.1007\/BFb0030294"},{"key":"164_CR12","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th IEEE Symposium on the Foundations of Computer Science, pp. 46\u201357. IEEE Computer Society Press (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"164_CR13","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A. Sistla","year":"1985","unstructured":"Sistla, A., Clarke, E.: The complexity of propositional linear temporal logics. J. ACM 32, 733\u2013749 (1985)","journal-title":"J. ACM"},{"issue":"2","key":"164_CR14","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/S0019-9958(79)90629-6","volume":"42","author":"W. Thomas","year":"1979","unstructured":"Thomas, W.: Star-free regular sets of \u03c9-sequences. Information and Control 42(2), 148\u2013156 (1979)","journal-title":"Information and Control"},{"key":"164_CR15","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, Formal Models and Semantics, pp. 133\u2013191. Elsevier (1990)","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"issue":"7","key":"164_CR16","first-page":"1","volume":"1906","author":"A. Thue","year":"1906","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Kra. Vidensk. Selsk. Skrifter, I. Mat. Nat. Kl. 1906(7), 1\u201322 (1906)","journal-title":"Kra. Vidensk. Selsk. Skrifter, I. Mat. Nat. Kl."},{"key":"164_CR17","doi-asserted-by":"crossref","unstructured":"Wilke, Th.: Classifying discrete temporal properties. In: Meinel, C., Tison, S. (eds.) STACS\u201999: Annual Symposium on Theoretical Aspects of Computer Science, vol. 1563 of Lecture Notes in Computer Science, pp. 32\u201346. Springer-Verlag (1999)","DOI":"10.1007\/3-540-49116-3_3"},{"key":"164_CR18","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/S0019-9958(83)80051-5","volume":"56","author":"P. Wolper","year":"1983","unstructured":"Wolper, P.: Temporal logic can be more expressive. Inform. Control 56, 72\u201399 (1983)","journal-title":"Inform. Control"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-005-0164-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-005-0164-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-005-0164-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T09:41:52Z","timestamp":1558690912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-005-0164-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5,24]]},"references-count":18,"journal-issue":{"issue":"7-8","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["164"],"URL":"https:\/\/doi.org\/10.1007\/s00236-005-0164-4","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,5,24]]}}}