{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T05:48:59Z","timestamp":1738216139420,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540784975"},{"type":"electronic","value":"9783540784999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78499-9_13","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T23:02:25Z","timestamp":1207090945000},"page":"172-185","source":"Crossref","is-referenced-by-count":7,"title":["The Common Fragment of ACTL and LTL"],"prefix":"10.1007","author":[{"given":"Miko\u0142aj","family":"Boja\u0144czyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/BFb0039607","volume-title":"STACS 87","author":"M. Arfi","year":"1987","unstructured":"Arfi, M.: Polynomial operations on rational languages. In: Brandenburg, F.J., Wirsing, M., Vidal-Naquet, G. (eds.) STACS 1987. LNCS, vol.\u00a0247, pp. 198\u2013206. Springer, Heidelberg (1987)"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(91)90268-7","volume":"91","author":"M. Arfi","year":"1991","unstructured":"Arfi, M.: Op\u00e9rations polynomiales et hi\u00e9rarchies de concat\u00e9nation. Theor. Comput. Sci.\u00a091(1), 71\u201384 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Draghicescu, I.A.: Expressibility results for linear-time and branching-time logics. In: REX Workshop, pp. 428\u2013437 (1988)","DOI":"10.1007\/BFb0013029"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"E.M. Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol.\u00a0131, pp. 52\u201371. Springer, Heidelberg (1982)"},{"key":"13_CR5","unstructured":"Kamp, J.A.: Tense Logic and the Theory of Linear Order. PhD thesis, Univ. of California, Los Angeles (1968)"},{"key":"13_CR6","unstructured":"Maidl, M.: The common fragment of CTL and LTL. In: Foundations of Computer Science, pp. 643\u2013652 (2000)"},{"key":"13_CR7","volume-title":"Infinite Words","author":"D. Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.-\u00c9.: Infinite Words. Elsevier, Amsterdam (2004)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02679450","volume":"30","author":"J.-\u00c9. Pin","year":"1997","unstructured":"Pin, J.-\u00c9., Weil, P.: Polynomial closure and unambiguous product. Theory Comput. Systems\u00a030, 1\u201330 (1997)","journal-title":"Theory Comput. Systems"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","first-page":"125","volume-title":"TAPSOFT \u201995: Theory and Practice of Software Development","author":"A. Potthoff","year":"1995","unstructured":"Potthoff, A.: First-order logic on finite trees. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) TAPSOFT 1995. LNCS, vol.\u00a0915, pp. 125\u2013139. Springer, Heidelberg (1995)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0304-3975(90)90047-L","volume":"72","author":"I. Simon","year":"1990","unstructured":"Simon, I.: Factorization forests of finite height. Theoretical Computer Science\u00a072, 65\u201394 (1990)","journal-title":"Theoretical Computer Science"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/0022-0000(82)90016-2","volume":"25","author":"W. Thomas","year":"1982","unstructured":"Thomas, W.: Classifying regular events in symbolic logic. Journal of Computer and System Sciences\u00a025, 360\u2013375 (1982)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78499-9_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:11:28Z","timestamp":1619521888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78499-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540784975","9783540784999"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78499-9_13","relation":{},"subject":[]}}