{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:14:04Z","timestamp":1762460044989,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030916305"},{"type":"electronic","value":"9783030916312"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91631-2_14","type":"book-chapter","created":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T21:02:24Z","timestamp":1637269344000},"page":"251-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Complexity of Verification of Time-Sensitive Distributed Systems"],"prefix":"10.1007","author":[{"given":"Max","family":"Kanovich","sequence":"first","affiliation":[]},{"given":"Tajana Ban","family":"Kirigin","sequence":"additional","affiliation":[]},{"given":"Vivek","family":"Nigam","sequence":"additional","affiliation":[]},{"given":"Andre","family":"Scedrov","sequence":"additional","affiliation":[]},{"given":"Carolyn","family":"Talcott","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,19]]},"reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF01782772","volume":"2","author":"B Alpern","year":"1987","unstructured":"Alpern, B., Schneider, F.B.: Recognizing safety and liveness. Distrib. Comput. 2(3), 117\u2013126 (1987)","journal-title":"Distrib. Comput."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.A.: Logics and models of real time: a survey. In: Real-Time: Theory in Practice, REX Workshop, pp. 74\u2013106 (1991)","DOI":"10.1007\/BFb0031988"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Decision problems for timed automata: a survey. In: SFM, pp. 1\u201324 (2004)","DOI":"10.1007\/978-3-540-30080-9_1"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"C\u00e1rdenas, A.A., Amin, S., Sastry, S.: Secure control: Towards survivable cyber-physical systems. In: ICDCS, pp. 495\u2013500 (2008)","DOI":"10.1109\/ICDCS.Workshops.2008.40"},{"key":"14_CR5","unstructured":"Cervesato, I., Durgin, N.A., Lincoln, P., Mitchell, J.C., Scedrov, A.: A meta-notation for protocol analysis. In: CSFW, pp. 55\u201369 (1999)"},{"issue":"6","key":"14_CR6","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.3233\/JCS-2009-0393","volume":"18","author":"MR Clarkson","year":"2010","unstructured":"Clarkson, M.R., Schneider, F.B.: Hyperproperties. J. Comput. Secur. 18(6), 1157\u20131210 (2010)","journal-title":"J. Comput. Secur."},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71999-1","volume-title":"All About Maude - A High-Performance Logical Framework","author":"M Clavel","year":"2007","unstructured":"Clavel, M., et al.: All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71999-1"},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.: On the security of public key protocols. IEEE Trans. Inf. Theor. 29(2), 198\u2013208 (1983)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.3233\/JCS-2004-12203","volume":"12","author":"NA Durgin","year":"2004","unstructured":"Durgin, N.A., Lincoln, P., Mitchell, J.C., Scedrov, A.: Multiset rewriting and the complexity of bounded security protocols. J. Comput. Secur. 12(2), 247\u2013311 (2004)","journal-title":"J. Comput. Secur."},{"key":"14_CR10","unstructured":"Enderton, H.B.: A Mathematical Introduction to Logic. Academic Press, Cambridge (1972)"},{"issue":"3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.entcs.2008.11.019","volume":"220","author":"M Faella","year":"2008","unstructured":"Faella, M., Legay, A., Stoelinga, M.: Model checking quantitative linear time logic. Electr. Notes Theor. Comput. Sci. 220(3), 61\u201377 (2008)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.ic.2014.07.011","volume":"238","author":"M Kanovich","year":"2014","unstructured":"Kanovich, M., Ban Kirigin, T., Nigam, V., Scedrov, A.: Bounded memory Dolev-Yao adversaries in collaborative systems. Inf. Comput. 238, 233\u2013261 (2014)","journal-title":"Inf. Comput."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Kanovich, M., Ban Kirigin, T., Nigam, V., Scedrov, A., Talcott, C.: Discrete vs. dense times in the analysis of cyber-physical security protocols. In: Principles of Security and Trust - 4th International Conference, POST, pp. 259\u2013279 (2015)","DOI":"10.1007\/978-3-662-46666-7_14"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Kanovich, M., Ban Kirigin, T., Nigam, V., Scedrov, A., Talcott, C.: Timed multiset rewriting and the verification of time-sensitive distributed systems. In: 14th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS) (2016)","DOI":"10.1007\/978-3-319-44878-7_14"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Kanovich, M., Ban Kirigin, T., Nigam, V., Scedrov, A., Talcott, C.: On the complexity of verification of time-sensitive distributed systems: Technical report (2021). http:\/\/arxiv.org\/abs\/2105.03531","DOI":"10.1007\/978-3-030-91631-2_14"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Kanovich, M., Ban Kirigin, T., Nigam, V., Scedrov, A., Talcott, C.L.: Timed multiset rewriting and the verification of time-sensitive distributed systems: Technical report (2016). http:\/\/arxiv.org\/abs\/1606.07886","DOI":"10.1007\/978-3-319-44878-7_14"},{"issue":"6","key":"14_CR17","doi-asserted-by":"publisher","first-page":"585","DOI":"10.3233\/JCS-0560","volume":"25","author":"M Kanovich","year":"2017","unstructured":"Kanovich, M., Ban Kirigin, T., Nigam, V., Scedrov, A., Talcott, C.L.: Time, computational complexity, and probability in the analysis of distance-bounding protocols. J. Comput. Secur. 25(6), 585\u2013630 (2017)","journal-title":"J. Comput. Secur."},{"key":"14_CR18","unstructured":"Kanovich, M., Ban Kirigin, T., Nigam, V., Scedrov, A., Talcott, C., Perovic, R.: A rewriting framework for activities subject to regulations. In: RTA, pp. 305\u2013322 (2012)"},{"issue":"3","key":"14_CR19","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1017\/S096012951500016X","volume":"27","author":"M Kanovich","year":"2017","unstructured":"Kanovich, M., Kirigin, T.B., Nigam, V., Scedrov, A., Talcott, C., Perovic, R.: A rewriting framework and logic for activities subject to regulations. Math. Struct. Comput. Sci. 27(3), 332\u2013375 (2017)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"3\u20134","key":"14_CR20","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10817-010-9190-1","volume":"46","author":"M Kanovich","year":"2011","unstructured":"Kanovich, M., Rowe, P., Scedrov, A.: Collaborative planning with confidentiality. J. Autom. Reasoning 46(3\u20134), 389\u2013421 (2011)","journal-title":"J. Autom. Reasoning"},{"issue":"4","key":"14_CR21","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01995674","volume":"2","author":"R Koymans","year":"1990","unstructured":"Koymans, R.: Specifying real-time properties with metric temporal logic. Real-time Syst. 2(4), 255\u2013299 (1990)","journal-title":"Real-time Syst."},{"issue":"1\u20133","key":"14_CR22","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0304-3975(02)00644-8","volume":"297","author":"F Laroussinie","year":"2003","unstructured":"Laroussinie, F., Schnoebelen, P., Turuani, M.: On the expressivity and complexity of quantitative branching-time temporal logics. Theor. Comput. Sci. 297(1\u20133), 297\u2013315 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Lutz, C., Walther, D., Wolter, F.: Quantitative temporal logics: PSPACE and below. In: TIME, pp. 138\u2013146 (2005)","DOI":"10.25368\/2022.146"},{"issue":"4","key":"14_CR24","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.entcs.2007.06.005","volume":"176","author":"PC \u00d6lveczky","year":"2007","unstructured":"\u00d6lveczky, P.C., Meseguer, J.: Abstraction and completeness for real-time maude. Electr. Notes Theor. Comput. Sci. 176(4), 5\u201327 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-78800-3_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"PC \u00d6lveczky","year":"2008","unstructured":"\u00d6lveczky, P.C., Meseguer, J.: The real-time maude tool. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 332\u2013336. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_23"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/11691372_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J Ouaknine","year":"2006","unstructured":"Ouaknine, J., Worrell, J.: Safety metric temporal logic is fully decidable. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 411\u2013425. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11691372_27"},{"key":"14_CR27","unstructured":"Papadimitriou, C.H.: Computational Complexity. Academic Internet Publishers, Cambridge (2007)"},{"issue":"3","key":"14_CR28","doi-asserted-by":"publisher","first-page":"299","DOI":"10.3233\/JCS-200012","volume":"29","author":"A Urquiza","year":"2021","unstructured":"Urquiza, A., et al.: Resource and timing aspects of security protocols. J. Comput. Secur. 29(3), 299\u2013340 (2021)","journal-title":"J. Comput. Secur."},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Urquiza, A., et al.: Resource-bounded intruders in denial of service attacks. In: 2019 IEEE 32nd Computer Security Foundations Symposium (CSF), pp. 382\u2013396. IEEE (2019)","DOI":"10.1109\/CSF.2019.00033"}],"container-title":["Lecture Notes in Computer Science","Protocols, Strands, and Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91631-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T16:09:08Z","timestamp":1726157348000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91631-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030916305","9783030916312"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91631-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"19 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}