{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T18:52:14Z","timestamp":1770749534759,"version":"3.50.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032111753","type":"print"},{"value":"9783032111760","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T00:00:00Z","timestamp":1763856000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T00:00:00Z","timestamp":1763856000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-11176-0_15","type":"book-chapter","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T20:11:23Z","timestamp":1763842283000},"page":"239-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Variety of\u00a0Request-Response Specifications"],"prefix":"10.1007","author":[{"given":"Daichi","family":"Aiba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaki","family":"Waga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroya","family":"Fujinami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koko","family":"Muroya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shutaro","family":"Ouchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Ueda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yosuke","family":"Yokoyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuta","family":"Wada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ichiro","family":"Hasuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,23]]},"reference":[{"key":"15_CR1","unstructured":"Aiba, D., et al.: A variety of request-response specifications (extended version) (2025). https:\/\/arxiv.org\/abs\/2509.13078"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-319-10575-8_17","volume-title":"Handbook of Model Checking","author":"R Alur","year":"2018","unstructured":"Alur, R., Bouajjani, A., Esparza, J.: Model checking procedural programs. In: Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.) Handbook of Model Checking, pp. 541\u2013572. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_17"},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-540-24730-2_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Alur","year":"2004","unstructured":"Alur, R., Etessami, K., Madhusudan, P.: A temporal logic of nested calls and returns. In: Jensen, K., Podelski, A. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 467\u2013481. Springer, Heidelberg (2004)"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1007\/11523468_89","volume-title":"Automata, Languages and Programming","author":"R Alur","year":"2005","unstructured":"Alur, R., Kumar, V., Madhusudan, P., Viswanathan, M.: Congruences for visibly pushdown languages. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1102\u20131114. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_89"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Alur, R., Kurshan, R.P., Viswanathan, M.: Membership questions for timed and hybrid automata. In: Proceedings of the 19th IEEE Real-Time Systems Symposium, Madrid, Spain, 2\u20134 December 1998, pp. 254\u2013263. IEEE Computer Society (1998). https:\/\/doi.org\/10.1109\/REAL.1998.739751","DOI":"10.1109\/REAL.1998.739751"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"15_CR8","doi-asserted-by":"publisher","unstructured":"Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. J. ACM 49(2), 172\u2013206 (2002). https:\/\/doi.org\/10.1145\/506147.506151","DOI":"10.1145\/506147.506151"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-75632-5_5","volume-title":"Lectures on Runtime Verification","author":"E Bartocci","year":"2018","unstructured":"Bartocci, E., et al.: Specification-based monitoring of cyber-physical systems: a survey on theory, tools and applications. In: Bartocci, E., Falcone, Y. (eds.) Lectures on Runtime Verification. LNCS, vol. 10457, pp. 135\u2013175. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-75632-5_5"},{"key":"15_CR10","first-page":"19","volume":"3","author":"DA Basin","year":"2017","unstructured":"Basin, D.A., Klaedtke, F., Zalinescu, E.: The monpoly monitoring tool. RV-CuBES 3, 19\u201328 (2017)","journal-title":"RV-CuBES"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-30494-4_18","volume-title":"Formal Methods in Computer-Aided Design","author":"A Cimatti","year":"2004","unstructured":"Cimatti, A., Roveri, M., Sheridan, D.: Bounded verification of past LTL. In: Hu, A.J., Martin, A.K. (eds.) Formal Methods in Computer-Aided Design, pp. 245\u2013259. Springer, Heidelberg (2004)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11513988_36","volume-title":"Computer Aided Verification","author":"M d\u2019Amorim","year":"2005","unstructured":"d\u2019Amorim, M., Ro\u015fu, G.: Efficient monitoring of $$\\omega $$-languages. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 364\u2013378. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11513988_36"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-40787-1_11","volume-title":"Runtime Verification","author":"N Decker","year":"2013","unstructured":"Decker, N., Leucker, M., Thoma, D.: Impartiality and anticipation for monitoring of visibly context-free properties. In: Legay, A., Bensalem, S. (eds.) Runtime Verification, pp. 183\u2013200. Springer, Heidelberg (2013)"},{"key":"15_CR14","unstructured":"Goldblatt, R.: Logics of time and computation. CSLI lecture notes; no. 7, Center for the Study of Language and Information, Stanford, CA (1987)"},{"issue":"1","key":"15_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10703-018-00327-4","volume":"56","author":"K Havelund","year":"2020","unstructured":"Havelund, K., Peled, D., Ulus, D.: First-order temporal logic monitoring with BDDs. Formal Methods Syst. Des. 56(1), 1\u201321 (2020)","journal-title":"Formal Methods Syst. Des."},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Menghi, C., et al.: ARCH-COMP23 category report: falsification. In: Frehse, G., Althoff, M. (eds.) Proceedings of 10th International Workshop on Applied Verification of Continuous and Hybrid Systems (ARCH 2023), San Antonio, Texas, USA, 9 May 2023. EPiC Series in Computing, vol.\u00a096, pp. 151\u2013169. EasyChair (2023). https:\/\/doi.org\/10.29007\/6nqs","DOI":"10.29007\/6nqs"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Murawski, A.S., Walukiewicz, I.: Third-order idealized algol with iteration is decidable. Theor. Comput. Sci. 390(2-3), 214\u2013229 (2008). https:\/\/doi.org\/10.1016\/j.tcs.2007.09.022","DOI":"10.1016\/j.tcs.2007.09.022"},{"key":"15_CR18","doi-asserted-by":"publisher","unstructured":"Reger, G.: A report of RV-cubes 2017. In: Reger, G., Havelund, K. (eds.) RV-CuBES 2017. An International Workshop on Competitions, Usability, Benchmarks, Evaluation, and Standardisation for Runtime Verification Tools. Kalpa Publications in Computing, vol.\u00a03, pp.\u00a01\u20139. EasyChair (2017). https:\/\/doi.org\/10.29007\/2496","DOI":"10.29007\/2496"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-89247-2_4","volume-title":"Runtime Verification","author":"G Ro\u015fu","year":"2008","unstructured":"Ro\u015fu, G., Chen, F., Ball, T.: Synthesizing monitors for safety properties: this time with calls and returns. In: Leucker, M. (ed.) Runtime Verification, pp. 51\u201368. Springer, Heidelberg (2008)"},{"key":"15_CR20","unstructured":"Saeedloei, N., Gupta, G.: Timed definite clause omega-grammars. In: Technical Communications of the 26th International Conference on Logic Programming, pp. 212\u2013221 (2010). Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2010)"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez, C., et al.: A survey of challenges for runtime verification from advanced application domains (beyond software). Formal Methods Syst. Des. 54(3), 279\u2013335 (2019). https:\/\/doi.org\/10.1007\/s10703-019-00337-w","DOI":"10.1007\/s10703-019-00337-w"},{"key":"15_CR22","doi-asserted-by":"publisher","unstructured":"Schwentick, T.: Automata for XML - a survey. J. Comput. Syst. Sci. 73(3), 289\u2013315 (2007). https:\/\/doi.org\/10.1016\/j.jcss.2006.10.003","DOI":"10.1016\/j.jcss.2006.10.003"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Srba, J.: Beyond language equivalence on visibly pushdown automata. Logical Methods Comput. Sci. 5 (2009)","DOI":"10.2168\/LMCS-5(1:2)2009"},{"issue":"6","key":"15_CR24","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K Thompson","year":"1968","unstructured":"Thompson, K.: Regular expression search algorithm. Commun. ACM 11(6), 419\u2013422 (1968). https:\/\/doi.org\/10.1145\/363347.363387","journal-title":"Commun. ACM"},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-662-48899-7_18","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"Y Uezato","year":"2015","unstructured":"Uezato, Y., Minamide, Y.: Synchronized recursive timed automata. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning, pp. 249\u2013265. Springer, Heidelberg (2015)"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-319-63387-9_16","volume-title":"Computer Aided Verification","author":"D Ulus","year":"2017","unstructured":"Ulus, D.: Montre: a tool for monitoring timed regular expressions. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 329\u2013335. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_16"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/3-540-60915-6_6","volume-title":"Logics for Concurrency","author":"MY Vardi","year":"1996","unstructured":"Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 238\u2013266. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60915-6_6"},{"key":"15_CR28","unstructured":"Waga, M.: Empowering runtime verification with polyhedra. Ph.D. thesis, Graduate University for Advanced Studies, Japan (2020). https:\/\/ci.nii.ac.jp\/naid\/500001483041"},{"key":"15_CR29","doi-asserted-by":"publisher","unstructured":"Waga, M., Hasuo, I., Suenaga, K.: MONAA: a tool for timed pattern matching with automata-based acceleration. In: 3rd Workshop on Monitoring and Testing of Cyber-Physical Systems, MT@CPSWeek 2018, 10 April 2018, pp. 14\u201315. IEEE (2018). https:\/\/doi.org\/10.1109\/MT-CPS.2018.00014","DOI":"10.1109\/MT-CPS.2018.00014"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11176-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T11:09:21Z","timestamp":1770721761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11176-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,23]]},"ISBN":["9783032111753","9783032111760"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11176-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,23]]},"assertion":[{"value":"23 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakesh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2025.digital-hub.sh\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}