{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:07:05Z","timestamp":1762459625594,"version":"3.37.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319893655"},{"type":"electronic","value":"9783319893662"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89366-2_11","type":"book-chapter","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T19:52:34Z","timestamp":1523649154000},"page":"203-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A Framework for Parameterized Monitorability"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2197-3018","authenticated-orcid":false,"given":"Luca","family":"Aceto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1314-333X","authenticated-orcid":false,"given":"Antonis","family":"Achilleos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3829-7391","authenticated-orcid":false,"given":"Adrian","family":"Francalanza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8362-3075","authenticated-orcid":false,"given":"Anna","family":"Ing\u00f3lfsd\u00f3ttir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,14]]},"reference":[{"issue":"2\u20133","key":"11_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","volume":"53","author":"S Abramsky","year":"1987","unstructured":"Abramsky, S.: Observation equivalence as a testing equivalence. Theor. Comput. Sci. 53(2\u20133), 225\u2013241 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR2","unstructured":"Aceto, L., Achilleos, A., Francalanza, A., Ing\u00f3lfsd\u00f3ttir, A.: Monitoring for silent actions. In: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017 (2017, to appear)"},{"key":"11_CR3","unstructured":"Aceto, L., Achilleos, A., Francalanza, A., Ing\u00f3lfsd\u00f3ttir, A., Kjartansson, S.\u00d6.: Determinizing monitors for HML with recursion. CoRR abs\/1611.10212 (2016)"},{"key":"11_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814105","volume-title":"Reactive Systems: Modelling, Specification and Verification","author":"L Aceto","year":"2007","unstructured":"Aceto, L., Ing\u00f3lfsd\u00f3ttir, A., Larsen, K.G., Srba, J.: Reactive Systems: Modelling, Specification and Verification. Cambridge University Press, New York (2007)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-319-19249-9_8","volume-title":"FM 2015: Formal Methods","author":"W Ahrendt","year":"2015","unstructured":"Ahrendt, W., Chimento, J.M., Pace, G.J., Schneider, G.: A specification language for static and runtime verification of data and control properties. In: Bj\u00f8rner, N., de Boer, F. (eds.) FM 2015. LNCS, vol. 9109, pp. 108\u2013125. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-19249-9_8"},{"issue":"1\u20132","key":"11_CR6","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.scico.2008.09.004","volume":"74","author":"I Aktug","year":"2008","unstructured":"Aktug, I., Naliuka, K.: ConSpec - a formal language for policy specification. Sci. Comput. Programm. 74(1\u20132), 2\u201312 (2008)","journal-title":"Sci. Comput. Programm."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Andersen, H.R.: Partial model checking (extended). In: Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, pp. 398\u2013407. IEEE (1995)","DOI":"10.1109\/LICS.1995.523274"},{"issue":"2\u20133","key":"11_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.tcs.2004.11.007","volume":"336","author":"C Artho","year":"2005","unstructured":"Artho, C., Barringer, H., Goldberg, A., Havelund, K., Khurshid, S., Lowry, M.R., Pasareanu, C.S., Rosu, G., Sen, K., Visser, W., Washington, R.: Combining test case generation and runtime verification. Theor. Comput. Sci. 336(2\u20133), 209\u2013234 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-319-46982-9_31","volume-title":"Runtime Verification","author":"DP Attard","year":"2016","unstructured":"Attard, D.P., Francalanza, A.: A monitoring tool for a branching-time logic. In: Falcone, Y., S\u00e1nchez, C. (eds.) RV 2016. LNCS, vol. 10012, pp. 473\u2013481. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-46982-9_31"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-66197-1_14","volume-title":"Software Engineering and Formal Methods","author":"DP Attard","year":"2017","unstructured":"Attard, D.P., Francalanza, A.: Trace partitioning and local monitoring for\u00a0asynchronous components. In: Cimatti, A., Sirjani, M. (eds.) SEFM 2017. LNCS, vol. 10469, pp. 219\u2013235. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-66197-1_14"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 193\u2013207. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-49059-0_14"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-319-33693-0_12","volume-title":"Integrated Formal Methods","author":"I Cassar","year":"2016","unstructured":"Cassar, I., Francalanza, A.: On implementing a monitor-oriented programming framework for actor systems. In: \u00c1brah\u00e1m, E., Huisman, M. (eds.) IFM 2016. LNCS, vol. 9681, pp. 176\u2013192. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-33693-0_12"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-662-46681-0_54","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Cini","year":"2015","unstructured":"Cini, C., Francalanza, A.: An LTL proof system for runtime verification. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 581\u2013595. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-46681-0_54"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-642-38088-4_34","volume-title":"NASA Formal Methods","author":"N Decker","year":"2013","unstructured":"Decker, N., Leucker, M., Thoma, D.: jUnit$$^{\\text{ RV }}$$RV\u2013adding runtime verification to jUnit. In: Brat, G., Rungta, N., Venet, A. (eds.) NFM 2013. LNCS, vol. 7871, pp. 459\u2013464. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-38088-4_34"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-319-67531-2_11","volume-title":"Runtime Verification","author":"A Desai","year":"2017","unstructured":"Desai, A., Dreossi, T., Seshia, S.A.: Combining model checking and runtime verification for safe robotics. In: Lahiri, S., Reger, G. (eds.) RV 2017. LNCS, vol. 10548, pp. 172\u2013189. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-67531-2_11"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.tcs.2014.02.052","volume":"537","author":"V Diekert","year":"2014","unstructured":"Diekert, V., Leucker, M.: Topology, monitorable properties and runtime verification. Theor. Comput. Sci. 537, 29\u201341 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"11_CR17","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10009-011-0196-8","volume":"14","author":"Y Falcone","year":"2012","unstructured":"Falcone, Y., Fernandez, J.C., Mounier, L.: What can you verify and enforce at runtime? Int. J. Softw. Tools Technol. Trans. 14(3), 349\u2013382 (2012)","journal-title":"Int. J. Softw. Tools Technol. Trans."},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-662-49630-5_9","volume-title":"Foundations of Software Science and Computation Structures","author":"A Francalanza","year":"2016","unstructured":"Francalanza, A.: A theory of monitors. In: Jacobs, B., L\u00f6ding, C. (eds.) FoSSaCS 2016. LNCS, vol. 9634, pp. 145\u2013161. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49630-5_9"},{"key":"11_CR19","unstructured":"Francalanza, A.: Consistently-detecting monitors. In: Meyer, R., Nestmann, U. (eds.) 28th International Conference on Concurrency Theory (CONCUR 2017). LIPIcs, vol. 85, pp. 8:1\u20138:19. Schloss Dagstuhl, Dagstuhl (2017)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-319-67531-2_2","volume-title":"Runtime Verification","author":"A Francalanza","year":"2017","unstructured":"Francalanza, A., Aceto, L., Achilleos, A., Attard, D.P., Cassar, I., Della Monica, D., Ing\u00f3lfsd\u00f3ttir, A.: A foundation for runtime monitoring. In: Lahiri, S., Reger, G. (eds.) RV 2017. LNCS, vol. 10548, pp. 8\u201329. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-67531-2_2"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-319-23820-3_5","volume-title":"Runtime Verification","author":"A Francalanza","year":"2015","unstructured":"Francalanza, A., Aceto, L., Ingolfsdottir, A.: On verifying Hennessy-Milner logic with recursion at runtime. In: Bartocci, E., Majumdar, R. (eds.) RV 2015. LNCS, vol. 9333, pp. 71\u201386. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23820-3_5"},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10703-017-0273-z","volume":"51","author":"A Francalanza","year":"2017","unstructured":"Francalanza, A., Aceto, L., Ingolfsdottir, A.: Monitorability for the Hennessy-Milner logic with recursion. Formal Meth. Syst. Des. (FMSD) 51(1), 87\u2013116 (2017)","journal-title":"Formal Meth. Syst. Des. (FMSD)"},{"issue":"2","key":"11_CR23","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S1571-0661(04)00252-X","volume":"55","author":"M Geilen","year":"2001","unstructured":"Geilen, M.: On the construction of monitors for temporal logic properties. Electron. Notes Theor. Comput. Sci. 55(2), 181\u2013199 (2001)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. ACM 32(1), 137\u2013161 (1985)","journal-title":"J. ACM"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-67531-2_14","volume-title":"Runtime Verification","author":"K Kejstov\u00e1","year":"2017","unstructured":"Kejstov\u00e1, K., Ro\u010dkai, P., Barnat, J.: From model checking to runtime verification\u00a0and back. In: Lahiri, S., Reger, G. (eds.) RV 2017. LNCS, vol. 10548, pp. 225\u2013240. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-67531-2_14"},{"issue":"3","key":"11_CR26","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional $$\\mu $$\u03bc-calculus. Theor. Comput. Sci. 27(3), 333\u2013354 (1983)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"11_CR27","first-page":"1","volume":"9","author":"F Lang","year":"2013","unstructured":"Lang, F., Mateescu, R.: Partial model checking using networks of labelled transition systems and boolean equation systems. Log. Meth. Comput. Sci. 9(4), 1\u201332 (2013)","journal-title":"Log. Meth. Comput. Sci."},{"issue":"2","key":"11_CR28","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0304-3975(90)90038-J","volume":"72","author":"KG Larsen","year":"1990","unstructured":"Larsen, K.G.: Proof systems for satisfiability in Hennessy-Milner logic with recursion. Theor. Comput. Sci. 72(2), 265\u2013288 (1990)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"11_CR29","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.jlap.2008.08.004","volume":"78","author":"M Leucker","year":"2009","unstructured":"Leucker, M., Schallhart, C.: A brief account of runtime verification. J. Log. Algebraic Program. 78(5), 293\u2013303 (2009)","journal-title":"J. Log. Algebraic Program."},{"key":"11_CR30","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall Inc, Upper Saddle River (1989)"},{"issue":"3","key":"11_CR31","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0304-3975(87)90117-4","volume":"50","author":"I Phillips","year":"1987","unstructured":"Phillips, I.: Refusal testing. Theor. Comput. Sci. 50(3), 241\u2013284 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/11813040_38","volume-title":"FM 2006: Formal Methods","author":"A Pnueli","year":"2006","unstructured":"Pnueli, A., Zaks, A.: PSL model checking and run-time verification via testers. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol. 4085, pp. 573\u2013586. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11813040_38"},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-40965-6_17","volume-title":"Advances in Computing Science \u2013 ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation","author":"K Sen","year":"2003","unstructured":"Sen, K., Ro\u015fu, G., Agha, G.: Generating optimal linear temporal logic monitors by coinduction. In: Saraswat, V.A. (ed.) ASIAN 2003. LNCS, vol. 2896, pp. 260\u2013275. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/978-3-540-40965-6_17"},{"key":"11_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3550-5","volume-title":"Modal and Temporal Properties of Processes","author":"C Stirling","year":"2001","unstructured":"Stirling, C.: Modal and Temporal Properties of Processes. Springer, New York (2001)"},{"key":"11_CR35","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). \nhttps:\/\/doi.org\/10.1007\/3-540-60915-6_6"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89366-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T19:56:27Z","timestamp":1523649387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89366-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319893655","9783319893662"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89366-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}