{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:34:09Z","timestamp":1725856449901},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319116280"},{"type":"electronic","value":"9783319116297"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11629-7_6","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T10:24:01Z","timestamp":1415960641000},"page":"41-50","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of Checking Strong Satisfiability of Reactive System Specifications"],"prefix":"10.1007","author":[{"given":"Masaya","family":"Shimakawa","sequence":"first","affiliation":[]},{"given":"Shigeki","family":"Hagihara","sequence":"additional","affiliation":[]},{"given":"Naoki","family":"Yonezaki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0035748","volume-title":"Automata, Languages and Programming","author":"M. Abadi","year":"1989","unstructured":"Abadi, M., Lamport, L., Wolper, P.: Realizable and unrealizable specifications of reactive systems. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol.\u00a0372, pp. 1\u201317. Springer, Heidelberg (1989)"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/963927.963928","volume":"5","author":"R. Alur","year":"2004","unstructured":"Alur, R., La Torre, S.: Deterministic generators and games for ltl fragments. ACM Trans. Comput. Logic\u00a05(1), 1\u201325 (2004)","journal-title":"ACM Trans. Comput. Logic"},{"key":"6_CR3","unstructured":"Boas, P.V.E.: The convenience of tilings. In: Complexity, Logic, and Recursion Theory, pp. 331\u2013363. Marcel Dekker Inc. (1997)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Hagihara, S., Kitamura, Y., Shimakawa, M., Yonezaki, N.: Extracting environmental constraints to make reactive system specifications realizable. In: Proc. of the 16th Asia-Pacific Software Engineering Conference, pp. 61\u201368. IEEE (2009)","DOI":"10.1109\/APSEC.2009.70"},{"key":"6_CR5","unstructured":"Hagihara, S., Yonezaki, N.: Completeness of verification methods for approaching to realizable reactive specifications. In: Proc. of 1st Asian Working Conference on Verified Software. UNU-IIST Technical Report, vol. 348, pp. 242\u2013257 (2006)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Jackson, D.: Automating first-order relational logic. In: Proceedings of the 8th ACM SIGSOFT International Symposium on Foundations of Software Engineering: Twenty-First Century Applications, SIGSOFT 2000\/FSE-8, pp. 130\u2013139. ACM (2000)","DOI":"10.1145\/355045.355063"},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF00288637","volume":"3","author":"Z. Manna","year":"1974","unstructured":"Manna, Z., Pnueli, A.: Axiomatic approach to total correctness of programs. Acta Informatica\u00a03(3), 243\u2013263 (1974)","journal-title":"Acta Informatica"},{"key":"6_CR8","unstructured":"Mori, R., Yonezaki, N.: Several realizability concepts in reactive objects. In: Information Modeling and Knowledge Bases (1993)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/3-540-58468-4_184","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"R. Mori","year":"1994","unstructured":"Mori, R., Yonezaki, N.: Derivation of the input conditional formula from a reactive system specification in temporal logic. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994 and ProCoS 1994. LNCS, vol.\u00a0863, pp. 567\u2013582. Springer, Heidelberg (1994)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11609773_24","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"N. Piterman","year":"2006","unstructured":"Piterman, N., Pnueli, A., Sa\u2019ar, Y.: Synthesis of reactive(1) designs. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 364\u2013380. Springer, Heidelberg (2006)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(81)90110-9","volume":"13","author":"A. Pnueli","year":"1981","unstructured":"Pnueli, A.: The temporal semantics of concurrent programs. Theoretical Computer Science\u00a013, 45\u201360 (1981)","journal-title":"Theoretical Computer Science"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 179\u2013190 (1989)","DOI":"10.1145\/75277.75293"},{"key":"6_CR13","unstructured":"Rosner, R.: Modular Synthesis of Reactive Systmes. Ph.D. thesis, Weizmann Institute of Science (1992)"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A.P. Sistla","year":"1985","unstructured":"Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. J. ACM\u00a032(3), 733\u2013749 (1985)","journal-title":"J. ACM"},{"issue":"2-3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","volume":"49","author":"A.P. Sistla","year":"1987","unstructured":"Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for B\u00fcchi automata with applications to temporal logic. Theor. Comput. Sci.\u00a049(2-3), 217\u2013237 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR16","unstructured":"Tauriainen, H.: On translating linear temporal logic into alternating and nondeterministic automata. Research Report A83, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland (2003)"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-37621-7_8","volume-title":"Software Security - Theories and Systems","author":"N. Yoshiura","year":"2004","unstructured":"Yoshiura, N.: Decision procedures for several properties of reactive system specifications. In: Futatsugi, K., Mizoguchi, F., Yonezaki, N. (eds.) ISSS 2003. LNCS, vol.\u00a03233, pp. 154\u2013173. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Signal Processing and Information Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11629-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T16:02:03Z","timestamp":1559059323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11629-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319116280","9783319116297"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11629-7_6","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2014]]}}}