{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:20:27Z","timestamp":1737436827771,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_10","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:32:38Z","timestamp":1188351158000},"page":"96-110","source":"Crossref","is-referenced-by-count":0,"title":["Linear Temporal Logic and Finite Semigroups"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Wilke","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"10_CR1","series-title":"Series in Algebra","doi-asserted-by":"crossref","DOI":"10.1142\/2481","volume-title":"Finite Semigroups and Universal Algebra","author":"J. Almeida","year":"1995","unstructured":"Jorge Almeida. Finite Semigroups and Universal Algebra, volume 3 of Series in Algebra. World Scientific, Singapore, 1995."},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0022-0000(93)90005-H","volume":"46","author":"J. Cohen","year":"1993","unstructured":"Jo\u00eblle Cohen, Dominique Perrin, and Jean-Eric Pin. On the expressive power of temporal logic. J. Comput. System Sci., 46(3):271\u2013294, 1993.","journal-title":"J. Comput. System Sci."},{"key":"10_CR3","series-title":"Pure and Applied Mathematics","volume-title":"Automata, Languages, and Machines","author":"S. Eilenberg","year":"1976","unstructured":"Samuel Eilenberg. Automata, Languages, and Machines, volume 59-B of Pure and Applied Mathematics. Academic Press, New York, 1976."},{"key":"10_CR4","first-page":"995","volume-title":"Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics","author":"A. E. Emerson","year":"1990","unstructured":"Allen E. Emerson. Temporal and modal logic. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics, pages 995\u20131072. Elsevier Science Publishers B. V., Amsterdam, 1990."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Kousha Etessami, Moshe Y. Vardi, and Thomas Wilke. First-order logic with two variables and unary temporal logic. In Proceedings 12th Annual IEEE Symposium on Logic in Computer Science, pages 228\u2013235, Warsaw, Poland, 1997.","DOI":"10.1109\/LICS.1997.614950"},{"key":"10_CR6","series-title":"Oxford Logic Guides","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0013976","volume-title":"Temporal Logic: Mathematical Foundations and Computational Aspects","author":"D. M. Gabbay","year":"1994","unstructured":"Dov M. Gabbay, Ian Hodkinson, and Mark Reynolds. Temporal Logic: Mathematical Foundations and Computational Aspects, vol. 1 of Oxford Logic Guides. Clarendon Press, Oxford, 1994."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Dov M. Gabbay, Amir Pnueli, Saharon Shelah, and Jonathan Stavi. On the temporal analysis of fairness. In Conference Record of the 12th ACM Symposium on Principles of Programming Languages, pages 163\u2013173, Las Vegas, Nev., 1980.","DOI":"10.1145\/567446.567462"},{"key":"10_CR8","series-title":"PhD thesis","volume-title":"Tense Logic and the Theory of Linear Order","author":"J. Anthony","year":"1968","unstructured":"Johan Anthony Willem Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, Calif., 1968."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Fred Kr\u00f6ger. LAR: A logic of algorithmic reasoning. Acta Informatica, 8(3), 1977.","DOI":"10.1007\/BF00264469"},{"key":"10_CR10","volume-title":"Counter-Free Automata","author":"R. McNaughton","year":"1971","unstructured":"Robert McNaughton and Seymour Papert. Counter-Free Automata. MIT Press, Cambridge, Mass., 1971."},{"key":"10_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of Formal Languages","author":"J.-E. Pin","year":"1986","unstructured":"Jean-Eric Pin. Varieties of Formal Languages. Plenum Press, New York, 1986."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Amir Pnueli. The temporal logic of programs. In 18th Annual Symposium on Foundations of Computer Science, pages 46\u201357, Rhode Island, Providence, 1977.","DOI":"10.1109\/SFCS.1977.32"},{"key":"10_CR13","first-page":"190","volume":"8","author":"M. P. Sch\u00fctzenberger","year":"1965","unstructured":"Marcel P. Sch\u00fctzenberger. On finite monoids having only trivial subgroups. Inform, and Computation, 8:190\u2013194, 1965.","journal-title":"Inform, and Computation"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0022-4049(98)00126-1","volume":"142","author":"B. Steinberg","year":"1999","unstructured":"Ben Steinberg. Semidirect products of categories and applications. Journal of Pure and Applied Algebra, 142:153\u2013182, 1999.","journal-title":"Journal of Pure and Applied Algebra"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0022-4049(85)90062-3","volume":"36","author":"H. Straubing","year":"1985","unstructured":"Howard Straubing. Finite semigroup varieties of the form V * D. J. Pure Appl. Algebra, 36:53\u201394, 1985.","journal-title":"J. Pure Appl. Algebra"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-4049(85)90071-4","volume":"36","author":"D. Th\u00e9rien","year":"1985","unstructured":"Denis Th\u00e9rien and Alex Weiss. Graph congruences and wreath products. J. Pure Appl. Algebra, 36:205\u2013215, 1985.","journal-title":"J. Pure Appl. Algebra"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Denis Th\u00e9rien and Thomas Wilke. Temporal logic and semidirect products: An effective characterization of the until hierarchy. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 256\u2013263, Burlington, Vermont, 1996.","DOI":"10.1109\/SFCS.1996.548484"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:27:42Z","timestamp":1737397662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}