{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:48Z","timestamp":1725664968088},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631415"},{"type":"electronic","value":"9783540691884"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63141-0_4","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:09:23Z","timestamp":1330297763000},"page":"45-58","source":"Crossref","is-referenced-by-count":9,"title":["A product version of dynamic linear time temporal logic"],"prefix":"10.1007","author":[{"given":"Jesper G.","family":"Henriksen","sequence":"first","affiliation":[]},{"given":"P. S.","family":"Thiagarajan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M. J. Fischer","year":"1979","unstructured":"Fischer, M. J., Ladner, R. E.: Prepositional dynamic logic of regular programs. Journal of Computer and System Sciences 18(2) (1979) 194\u2013211","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Gabbay, A., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. Proceedings of the 7th Annual Symposium on Principles of Programming Languages, ACM (1980) 163\u2013173","DOI":"10.1145\/567446.567462"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Godefroid, P.: Partial-order Methods for the Verification of Concurrent Systems. Lecture Notes in Computer Science 1032, Springer-Verlag (1996)","DOI":"10.1007\/3-540-60761-7"},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/978-94-009-6259-0_10","volume-title":"Handbook of Philosophical Logic, Vol. II","author":"D. Harel","year":"1984","unstructured":"Harel, D.: Dynamic logic. In Gabbay, D., Guenthner, F., eds.: Handbook of Philosophical Logic, Vol. II, Reidel, Dordrecht (1984) 497\u2013604"},{"key":"4_CR5","volume-title":"BRICS technical report RS-97-8","author":"J. G. Henriksen","year":"1997","unstructured":"Henriksen, J. G., Thiagarajan, P. S.: Dynamic linear time temporal logic. BRICS technical report RS-97-8, Department of Computer Science, University of Aarhus, Denmark (1997)"},{"key":"4_CR6","unstructured":"Hromkovi\u010d, J., Seibert, S., Wilke, T.: Translating regular expressions into small \u03b5-free nondeterministic automata. Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 1200, Springer-Verlag (1997) 55\u201366"},{"key":"4_CR7","unstructured":"Kamp, H. R.: Tense Logic and the Theory of Linear Order. Ph.D. thesis, University of California (1968)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems (Specification), Springer-Verlag (1992)","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"4_CR9","volume-title":"Technical report DAIMI PB-78","author":"A. Mazurkiewicz","year":"1977","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretations. Technical report DAIMI PB-78, Department of Computer Science, University of Aarhus, Denmark (1977)"},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Information and Control 9 (1966) 521\u2013530","journal-title":"Information and Control"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Mukund, M., Thiagarajan, P. S.: Linear time temporal logics over Mazurkiewicz traces. Proceedings of the 21st Intl. Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 1113, Springer-Verlag (1996) pp. 62\u201392","DOI":"10.1007\/3-540-61550-4_140"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Peled, D.: Partial order reduction: model checking using representatives. Proceedings of the 21st Intl. Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 1113, Springer-Verlag (1996) 93\u2013112","DOI":"10.1007\/3-540-61550-4_141"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. Proceedings of the 18th Annual Symposium on Foundations of Computer Science, IEEE (1977) 46\u201357","DOI":"10.1109\/SFCS.1977.32"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Thiagarajan, P. S.: A trace based extension of linear time temporal logic. Proceedings of the 9th Annual Symposium on Logic in Computer Science, IEEE (1994) 438\u2013447","DOI":"10.1109\/LICS.1994.316047"},{"key":"4_CR15","volume-title":"Technical report TCS-95-4","author":"P. S. Thiagarajan","year":"1995","unstructured":"Thiagarajan, P. S.: PTL over product state spaces. Technical report TCS-95-4, School of Mathematics, SPIC Science Foundation, Madras (1995)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Thiagarajan, P. S.: A trace consistent subset of PTL. Proceedings of the 6th Annual Conference on Concurrency Theory, Lecture Notes in Computer Science 962, Springer-Verlag (1995) 438\u2013452","DOI":"10.1007\/3-540-60218-6_33"},{"key":"4_CR17","unstructured":"Thomas, W.: Automata over infinite objects. In van Leeuwen, J., ed., Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, Elsevier\/MIT Press (1990) 133\u2013191"},{"key":"4_CR18","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF00709154","volume":"1","author":"A. Valmari","year":"1992","unstructured":"Valmari, A.: A stubborn attack on state explosion. Formal Methods in Systems Design 1 (1992) 285\u2013313","journal-title":"Formal Methods in Systems Design"},{"key":"4_CR19","unstructured":"Vardi, M. Y., Wolper, P.: An automata-theoretic approach to automatic program verification. Proceedings of the 1st Annual Symposium on Logic in Computer Science, IEEE (1986) 332\u2013345"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Wolper, P.: Temporal logic can be more expressive. Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, IEEE (1981) 340\u2013348","DOI":"10.1109\/SFCS.1981.44"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Wolper, P., Vardi, M. Y., Sistla, A. P.: Reasoning about infinite computation paths. Proceedings of the 24nd Annual Symposium on Foundations of Computer Science, IEEE (1983) 185\u2013194","DOI":"10.1109\/SFCS.1983.51"},{"key":"4_CR22","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"Zielonka, W.: Notes on finite asynchronous automata. R.A.I.R.O. Informatique Th\u00e9orique et Applications 21 (1987) 99\u2013135","journal-title":"Informatique Th\u00e9orique et Applications"}],"container-title":["Lecture Notes in Computer Science","CONCUR '97: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63141-0_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:42:09Z","timestamp":1619574129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63141-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631415","9783540691884"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-63141-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}