{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:38Z","timestamp":1725456338829},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029985","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:24:59Z","timestamp":1133418299000},"page":"418-427","source":"Crossref","is-referenced-by-count":0,"title":["Decomposition of TrPTL formulas"],"prefix":"10.1007","author":[{"given":"Rapha\u00ebl","family":"Meyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Petit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"J. Berstel. Transductions and context-free languages. Teubner Studienb\u00fccher, 1979.","DOI":"10.1007\/978-3-663-09367-1"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"V. Diekert. Combinatorics on Traces. Number 454 in LNCS. Springer, 1990.","DOI":"10.1007\/3-540-53031-2"},{"volume-title":"The Book of Traces","year":"1995","key":"42_CR3","unstructured":"V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995."},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"W. Ebinger and A. Muscholl. Logical definability on infinite traces. In A. Lingas, R. Karlsson, and S. Carlsson, editors, Proc. of the 20th ICALP, Lund (Sweden) 1993, number 700 in LNCS, pages 335\u2013346. Springer, 1993.","DOI":"10.1007\/3-540-56939-1_84"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"P. Gastin and A. Petit. Asynchronous automata for infinite traces. In W. Kuich, editor, Proc. of the 19th ICALP, Vienna (Austria) 1992, number 623 in LNCS, pages 583\u2013594. Springer, 1992.","DOI":"10.1007\/3-540-55719-9_106"},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0304-3975(94)90254-2","volume":"125","author":"P. Gastin","year":"1994","unstructured":"P. Gastin, A. Petit, and W. Zielonka. An extension of Kleene's and Ochma\u0144ski's theorems to infinite traces. Theoret. Comp. Sci., 125:167\u2013204, 1994. A preliminary version was presented at ICALP'91, LNCS 510 (1991).","journal-title":"Theoret. Comp. Sci."},{"key":"42_CR7","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1006\/inco.1994.1035","volume":"110","author":"P. Godefroid","year":"1994","unstructured":"P. Godefroid and P. Wolper. A partial approach to model checking. Inform. and Comp., 110:305\u2013326, 1994.","journal-title":"Inform. and Comp."},{"key":"42_CR8","first-page":"21","volume":"75","author":"S. Katz","year":"1992","unstructured":"S. Katz and D. Peled. Interleaving set temporal logic. Theoret. Comp. Sci., 75:21\u201343, 1992.","journal-title":"Theoret. Comp. Sci."},{"issue":"2","key":"42_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1142\/S0129054192000103","volume":"3","author":"K. Lodaya","year":"1992","unstructured":"K. Lodaya, R. Ramajunam, and P.S. Thiagarajan. Temporal logics for communicating sequential agents:I. Int. J. of Found. of Comp. Sci., 3(2):117\u2013159, 1992.","journal-title":"Int. J. of Found. of Comp. Sci."},{"key":"42_CR10","series-title":"DAIMI Rep. PB 78","volume-title":"Concurrent program schemes and their interpretations","author":"A. Mazurkiewicz","year":"1977","unstructured":"A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977."},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(92)90181-E","volume":"96","author":"M. Mukund","year":"1992","unstructured":"M. Mukund and P.S. Thiagarajan. A logical characterization of well branching event structures. Theoret. Comp. Sci., 96:35\u201372, 1992.","journal-title":"Theoret. Comp. Sci."},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"M. Mukund and P.S. Thiagarajan. Linear time temporal logics over Mazurkiewicz traces. In Proc. of the 21th MFCS, 1996, number 1113 in LNCS, pages 62\u201392. Springer, 1996.","DOI":"10.1007\/3-540-61550-4_140"},{"key":"42_CR13","doi-asserted-by":"crossref","first-page":"297","DOI":"10.3233\/FI-1988-11307","volume":"XI","author":"W. Penczek","year":"1988","unstructured":"W. Penczek. A temporal logic for event structures. Fundamenta Informaticae, XI:297\u2013326, 1988.","journal-title":"Fundamenta Informaticae"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"W. Penczek and R. Kuiper. Traces and logic. In V. Diekert and G. Rozenberg, editors, The book of Traces, pages 307\u2013381, 1995.","DOI":"10.1142\/9789814261456_0010"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"A. Pnueli. The temporal logics of programs. In Proc. of the 18th IEEE FOCS, 1977, pages 46\u201357, 1977.","DOI":"10.1109\/SFCS.1977.32"},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"P.S. Thiagarajan. A trace based extension of linear time temporal logic. In Proc. of the 9th LICS, 1994, pages 438\u2013447, 1994.","DOI":"10.1109\/LICS.1994.316047"},{"key":"42_CR17","unstructured":"W. Thomas. On logical definability of trace languages. In V. Diekert, editor, Proc. an ASMICS workshop, Kochel am See 1989, Report TUM-19002, Technical University of Munich, pages 172\u2013182, 1989."},{"key":"42_CR18","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. In J. v. Leeuwen, editor, Handbook of Theoretical Computer Science, pages 133\u2013191. Elsevier Science Publishers, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"P.S. Thiagarajan and l. Walukiewicz. An expressively complete linear time temporal logic for Mazurkiewicz traces. In Proc. of LICS'97 (to appear), 1997.","DOI":"10.7146\/brics.v3i62.18563"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029985","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T20:20:44Z","timestamp":1626812444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029985"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0029985","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}