{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:13:16Z","timestamp":1725491596762},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540752905"},{"type":"electronic","value":"9783540752929"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75292-9_22","type":"book-chapter","created":{"date-parts":[[2007,9,11]],"date-time":"2007-09-11T10:43:07Z","timestamp":1189507387000},"page":"322-336","source":"Crossref","is-referenced-by-count":0,"title":["Axiomatizing Extended Temporal Logic Fragments Via Instantiation"],"prefix":"10.1007","author":[{"given":"Wanwei","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huowang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-46002-0_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Armoni","year":"2002","unstructured":"Armoni, R., Fix, L., Flaisher, A., Gerth, R., Ginsburg, B., Kanza, T., Landver, A., Mador-Haim, S., Singerman, E., Tiemeyer, A., Vardi, M.Y., Zbar, Y.: The forspec temporal logic: A new temporal property-specification language. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol.\u00a02280, pp. 211\u2013296. Springer, Heidelberg (2002)"},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2004.12.021","volume":"119","author":"R. Armoni","year":"2005","unstructured":"Armoni, R., Fix, L., Fraer, R., Huddleston, S., Piterman, N., Vardi, M.Y.: Sat-based induction for temporal safety properties. Electr. Notes Theor. Comput. Sci.\u00a0119(2), 3\u201316 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-51803-7_22","volume-title":"Temporal Logic in Specification","author":"B. Banieqbal","year":"1989","unstructured":"Banieqbal, B., Barringer, H.: Temporal logic with fixed points. In: Banieqbal, B., Pnueli, A., Barringer, H. (eds.) Temporal Logic in Specification. LNCS, vol.\u00a0398, pp. 62\u201374. Springer, Heidelberg (1989)"},{"key":"22_CR4","unstructured":"French, T., Reynolds, M.: A sound and complete proof system for QPTL. In: Proceedings of 4th Advances in Modal Logic, pp. 127\u2013148. King\u2019s College Publications (2003)"},{"key":"22_CR5","unstructured":"Kaivola, R.: Using Automata to Characterise Fixed Point Temporal Logics. PhD thesis, University of Edinburgh (1997)"},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0304-3975(97)00083-2","volume":"190","author":"R. Kaivola","year":"1998","unstructured":"Kaivola, R.: Axiomatising extended computation tree logic. Theoretical Computer Science\u00a0190(1), 41\u201360 (1998)","journal-title":"Theoretical Computer Science"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/978-3-540-30476-0_27","volume-title":"Automated Technology for Verification and Analysis","author":"O. Kupferman","year":"2004","unstructured":"Kupferman, O., Morgenstern, G., Murano, A.: Typeness for \u03c9-regular automata. In: Wang, F. (ed.) ATVA 2004. LNCS, vol.\u00a03299, pp. 324\u2013333. Springer, Heidelberg (2004)"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Kesten, Y., Pnueli, A.: A complete proof systems for QPTL. In: Logic in Computer Science, pp. 2\u201312 (1995)","DOI":"10.1109\/LICS.1995.523239"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/3-540-44685-0_35","volume-title":"CONCUR 2001 - Concurrency Theory","author":"O. Kupferman","year":"2001","unstructured":"Kupferman, O., Piterman, N., Vardi, M.Y.: Extended temporal logic revisited. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 519\u2013535. Springer, Heidelberg (2001)"},{"key":"22_CR10","volume-title":"LICS 2001","author":"M. Lange","year":"2001","unstructured":"Lange, M., Stirling, C.: Focus games for satisfiability and completeness of temporal logic. In: LICS 2001. Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, Boston, MA, USA, IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"22_CR11","unstructured":"Piterman, N.: Extending temporal logic with \u03c9-automata. Thesis for the M.Sc Degree, School of the Weizmann Institute of Science (August 2000)"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","volume":"49","author":"S.A. Prasad","year":"1987","unstructured":"Prasad, S.A., Vardi, M.Y., Wolper, P.: The complementation problem for B\u00fcchi automata with applications to temporal logic. Theoretical Computer Science\u00a049, 217\u2013237 (1987)","journal-title":"Theoretical Computer Science"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45319-9_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M.Y. Vardi","year":"2001","unstructured":"Vardi, M.Y.: Branching vs. linear time: Final showdown. In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol.\u00a02031, pp. 1\u201322. Springer, Heidelberg (2001)"},{"issue":"1","key":"22_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1092","volume":"115","author":"M.Y. Vardi","year":"1994","unstructured":"Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Information and Computation\u00a0115(1), 1\u201337 (1994)","journal-title":"Information and Computation"},{"issue":"1-2","key":"22_CR15","doi-asserted-by":"publisher","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. Information and Control\u00a056(1-2), 72\u201399 (1983)","journal-title":"Information and Control"},{"key":"22_CR16","first-page":"185","volume-title":"Proc. 24th IEEE Symposium on Foundations of Computer Science","author":"P. Wolper","year":"1983","unstructured":"Wolper, P., Vardi, M.Y., Sistla, A.P.: Reasoning about infinite computation paths. In: Proc. 24th IEEE Symposium on Foundations of Computer Science, Tucson, pp. 185\u2013194. IEEE Computer Society Press, Los Alamitos (1983)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75292-9_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:58:57Z","timestamp":1619521137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75292-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540752905","9783540752929"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75292-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}