{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:03:51Z","timestamp":1762459431974},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319448770"},{"type":"electronic","value":"9783319448787"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-44878-7_14","type":"book-chapter","created":{"date-parts":[[2016,8,16]],"date-time":"2016-08-16T15:20:46Z","timestamp":1471360846000},"page":"228-244","source":"Crossref","is-referenced-by-count":8,"title":["Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems"],"prefix":"10.1007","author":[{"given":"Max","family":"Kanovich","sequence":"first","affiliation":[]},{"given":"Tajana","family":"Ban 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":[[2016,8,17]]},"reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"crossref","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","series-title":"Lecture Notes in Computer Science","first-page":"74","volume-title":"Real-Time: Theory in Practice","author":"R Alur","year":"1991","unstructured":"Alur, R., Henzinger, T.A.: Logics and models of real time: a survey. In: de Bakker, J.W., Huizing, C., de Roever, W.P., Rozenberg, G. (eds.) REX Workshop. LNCS, vol. 600, pp. 74\u2013106. Springer, Heidelberg (1991)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"R Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Decision problems for timed automata: a survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 1\u201324. Springer, Heidelberg (2004)"},{"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)","key":"14_CR4","DOI":"10.1109\/ICDCS.Workshops.2008.40"},{"issue":"6","key":"14_CR5","doi-asserted-by":"crossref","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_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"All About Maude: A High-Performance Logical Framework","author":"M Clavel","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.: All About Maude: A High-Performance Logical Framework. LNCS. Springer, Heidelberg (2007)"},{"issue":"2","key":"14_CR7","doi-asserted-by":"crossref","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. Theory 29(2), 198\u2013208 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"14_CR8","doi-asserted-by":"crossref","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_CR9","volume-title":"A Mathematical Introduction to Logic","author":"B Herbert","year":"1972","unstructured":"Herbert, B., Enderton, H.B.: A Mathematical Introduction to Logic. Academic Press, Salt lake city (1972)"},{"issue":"3","key":"14_CR10","doi-asserted-by":"crossref","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. Electron. Notes Theoret. Comput. Sci. 220(3), 61\u201377 (2008)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"14_CR11","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.ic.2014.07.011","volume":"238","author":"M Kanovich","year":"2014","unstructured":"Kanovich, M., Kirigin, T.B., Nigam, V., Scedrov, A.: Bounded memory Dolev-Yao adversaries in collaborative systems. Inf. Comput. 238, 233\u2013261 (2014)","journal-title":"Inf. Comput."},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/978-3-662-46666-7_14","volume-title":"Principles of Security and Trust","author":"M Kanovich","year":"2015","unstructured":"Kanovich, M., Kirigin, T.B., Nigam, V., Scedrov, A., Talcott, C.: Discrete vs. dense times in the analysis of cyber-physical security protocols. In: Focardi, R., Myers, A. (eds.) POST 2015. LNCS, vol. 9036, pp. 259\u2013279. Springer, Heidelberg (2015)"},{"doi-asserted-by":"publisher","unstructured":"Kanovich, M., Kirigin, T.B., Nigam, V., Scedrov, A., Talcott, C.: A rewriting framework and logic for activities subject to regulations. Math. Struct. Comput. Sci. (2015). (online) doi: 10.1017\/S096012951500016X","key":"14_CR13","DOI":"10.1017\/S096012951500016X"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/978-3-642-40203-6_18","volume-title":"Computer Security \u2013 ESORICS 2013","author":"M Kanovich","year":"2013","unstructured":"Kanovich, M., Ban Kirigin, T., Nigam, V., Scedrov, A.: Bounded memory protocols and progressing collaborative systems. In: Crampton, J., Jajodia, S., Mayes, K. (eds.) ESORICS 2013. LNCS, vol. 8134, pp. 309\u2013326. Springer, Heidelberg (2013)"},{"doi-asserted-by":"crossref","unstructured":"Kanovich, M., Kirigin, T.B., Nigam, V., Scedrov, A., Talcott, C.: Timed multiset rewriting and the verification of time-sensitive distributed systems. CoRR, abs\/1606.07886 (2016)","key":"14_CR15","DOI":"10.1007\/978-3-319-44878-7_14"},{"unstructured":"Kanovich, M.I., Kirigin, T.B., Nigam, V., Scedrov, A., Talcott, C.L., Perovic, R.: A rewriting framework for activities subject to regulations. In: RTA, pp. 305\u2013322 (2012)","key":"14_CR16"},{"issue":"3\u20134","key":"14_CR17","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10817-010-9190-1","volume":"46","author":"MI Kanovich","year":"2011","unstructured":"Kanovich, M.I., Rowe, P., Scedrov, A.: Collaborative planning with confidentiality. J. Autom. Reason. 46(3\u20134), 389\u2013421 (2011)","journal-title":"J. Autom. Reason."},{"issue":"1","key":"14_CR18","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 297(1), 297\u2013315 (2003)","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Lutz, C., Walther, D., Wolter, F.: Quantitative temporal logics: PSPACE and below. In: TIME, pp. 138\u2013146 (2005)","key":"14_CR19","DOI":"10.25368\/2022.146"},{"issue":"4","key":"14_CR20","doi-asserted-by":"crossref","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. Electron. Notes Theoret. Comput. Sci. 176(4), 5\u201327 (2007)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"14_CR22","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"2007","unstructured":"Papadimitriou, C.H.: Computational Complexity. Academic Internet Publ, Ventura (2007)"},{"key":"14_CR23","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"WJ Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationship between nondeterministic and deterministic tape classes. J. Comput. Syst. Sci. 4, 177\u2013192 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/978-3-319-15545-6_18","volume-title":"Software, Services, and Systems","author":"C Talcott","year":"2015","unstructured":"Talcott, C., Arbab, F., Yadav, M.: Soft agents: exploring soft constraints to model robust adaptive distributed cyber-physical agent systems. In: De Nicola, R., Hennicker, R. (eds.) Wirsing Festschrift. LNCS, vol. 8950, pp. 273\u2013290. Springer, Heidelberg (2015)"},{"doi-asserted-by":"crossref","unstructured":"Talcott, C., Nigam, V., Arbab, F., Kapp\u00e9, T.: Formal specification and analysis of robust adaptive distributed cyber-physical systems. In: Formal Methods for the Quantitative Evaluation of Collective AdaptiveSystems (2016)","key":"14_CR25","DOI":"10.1007\/978-3-319-34096-8_1"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44878-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T02:30:50Z","timestamp":1657074650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44878-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319448770","9783319448787"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44878-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}