{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T14:20:24Z","timestamp":1763389224314,"version":"3.37.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030214845"},{"type":"electronic","value":"9783030214852"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-21485-2_4","type":"book-chapter","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T10:04:18Z","timestamp":1562148258000},"page":"28-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Testing Equivalence vs. Runtime Monitoring"],"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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1171-8790","authenticated-orcid":false,"given":"Karoliina","family":"Lehtinen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,3]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-89366-2_11","volume-title":"Foundations of Software Science and Computation Structures","author":"L Aceto","year":"2018","unstructured":"Aceto, L., Achilleos, A., Francalanza, A., Ing\u00f3lfsd\u00f3ttir, A.: A framework for parameterized monitorability. In: Baier, C., Dal Lago, U. (eds.) FoSSaCS 2018. LNCS, vol. 10803, pp. 203\u2013220. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-89366-2_11"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-60134-2_1","volume-title":"Implementation and Application of Automata","author":"L Aceto","year":"2017","unstructured":"Aceto, L., Achilleos, A., Francalanza, A., Ing\u00f3lfsd\u00f3ttir, A., Kjartansson, S.\u00d6.: On the complexity of determinizing monitors. In: Carayol, A., Nicaud, C. (eds.) CIAA 2017. LNCS, vol. 10329, pp. 1\u201313. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-60134-2_1"},{"issue":"POPL","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3290365","volume":"3","author":"Luca Aceto","year":"2019","unstructured":"Aceto, L., Achilleos, A., Francalanza, A., Ing\u00f3lfsd\u00f3ttir, A., Lehtinen, K.: Adventures in monitorability: from branching to linear time and back again. In: Proceedings of the ACM on Programming Languages (POPL), vol. 3, pp. 52:1\u201352:29 (2019). \n                      https:\/\/dl.acm.org\/citation.cfm?id=3290365","journal-title":"Proceedings of the ACM on Programming Languages"},{"key":"4_CR4","unstructured":"Aceto, L., Achilleos, A., Francalanza, A., Ing\u00f3lfsd\u00f3ttir, A., Lehtinen, K.: The cost of monitoring alone. CoRR abs\/1902.05152 (2019). \n                      http:\/\/arxiv.org\/abs\/1902.05152"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-18419-8_9","volume-title":"Mathematical Models for the Semantics of Parallelism","author":"L Aceto","year":"1987","unstructured":"Aceto, L., De Nicola, R., Fantechi, A.: Testing equivalences for event structures. In: Zilli, M.V. (ed.) Mathematical Models for the Semantics of Parallelism. LNCS, vol. 280, pp. 1\u201320. Springer, Heidelberg (1987). \n                      https:\/\/doi.org\/10.1007\/3-540-18419-8_9"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-54430-5_82","volume-title":"CONCUR \u201991","author":"L Aceto","year":"1991","unstructured":"Aceto, L., Ing\u00f3lfsd\u00f3ttir, A.: A theory of testing for ACP. In: Baeten, J.C.M., Groote, J.F. (eds.) CONCUR 1991. LNCS, vol. 527, pp. 78\u201395. Springer, Heidelberg (1991). \n                      https:\/\/doi.org\/10.1007\/3-540-54430-5_82"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-49019-1_4","volume-title":"Foundations of Software Science and Computation Structures","author":"L Aceto","year":"1999","unstructured":"Aceto, L., Ing\u00f3lfsd\u00f3ttir, A.: Testing Hennessy-Milner logic with recursion. In: Thomas, W. (ed.) FoSSaCS 1999. LNCS, vol. 1578, pp. 41\u201355. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/3-540-49019-1_4"},{"key":"4_CR8","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). \n                      https:\/\/doi.org\/10.1017\/cbo9780511814105"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-75632-5","volume-title":"Lectures on Runtime Verification - Introductory and Advanced Topics","year":"2018","unstructured":"Bartocci, E., Falcone, Y. (eds.): Lectures on Runtime Verification - Introductory and Advanced Topics. LNCS, vol. 10457. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-75632-5"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.scico.2018.08.004","volume":"168","author":"GT Bernardi","year":"2018","unstructured":"Bernardi, G.T., Francalanza, A.: Full-abstraction for client testing preorders. Sci. Comput. Program. 168, 94\u2013117 (2018). \n                      https:\/\/doi.org\/10.1016\/j.scico.2018.08.004","journal-title":"Sci. Comput. Program."},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"SD Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM 31(3), 560\u2013599 (1984). \n                      https:\/\/doi.org\/10.1145\/828.833","journal-title":"J. ACM"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.4204\/EPTCS.41.3","volume":"41","author":"Andrea Cerone","year":"2010","unstructured":"Cerone, A., Hennessy, M.: Process behaviour: formulae vs. tests (extended abstract). In: Fr\u00f6schle, S.B., Valencia, F.D. (eds.) Proceedings 17th International Workshop on Expressiveness in Concurrency, EXPRESS 2010. Electronic Proceedings in Theoretical Computer Science, vol. 41, pp. 31\u201345 (2010). \n                      https:\/\/doi.org\/10.4204\/EPTCS.41.3","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF00264365","volume":"24","author":"R Nicola De","year":"1987","unstructured":"De Nicola, R.: Extensional equivalences for transition systems. Acta Informatica 24(2), 211\u2013237 (1987). \n                      https:\/\/doi.org\/10.1007\/BF00264365","journal-title":"Acta Informatica"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/BFb0036936","volume-title":"Automata, Languages and Programming","author":"R Nicola de","year":"1983","unstructured":"de Nicola, R., Hennessy, M.C.B.: Testing equivalences for processes. In: Diaz, Josep (ed.) ICALP 1983. LNCS, vol. 154, pp. 548\u2013560. Springer, Heidelberg (1983). \n                      https:\/\/doi.org\/10.1007\/BFb0036936"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R Nicola De","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theor. Comput. Sci. 34, 83\u2013133 (1984). \n                      https:\/\/doi.org\/10.1016\/0304-3975(84)90113-0","journal-title":"Theor. Comput. Sci."},{"key":"4_CR16","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). \n                      https:\/\/doi.org\/10.1007\/978-3-319-23820-3_5"},{"issue":"1","key":"4_CR17","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. Form. Methods Syst. Des. 51(1), 87\u2013116 (2017). \n                      https:\/\/doi.org\/10.1007\/s10703-017-0273-z","journal-title":"Form. Methods Syst. Des."},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/B978-044482830-9\/50019-9","volume-title":"Handbook of Process Algebra","author":"RJ Glabbeek van","year":"2001","unstructured":"van Glabbeek, R.J.: The linear time - branching time spectrum I: the semantics of concrete, sequential processes (Chap. 1). In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 3\u201399. Elsevier, Amsterdam (2001)"},{"key":"4_CR19","volume-title":"Algebraic Theory of Processes","author":"M Hennessy","year":"1988","unstructured":"Hennessy, M.: Algebraic Theory of Processes. Foundations of Computing, MIT Press, Cambridge (1988)"},{"issue":"2","key":"4_CR20","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1006\/inco.1993.1067","volume":"107","author":"M Hennessy","year":"1993","unstructured":"Hennessy, M., Ingolfsdottir, A.: A theory of communicating processes with value passing. Inf. Comput. 107(2), 202\u2013236 (1993). \n                      https:\/\/doi.org\/10.1006\/inco.1993.1067","journal-title":"Inf. Comput."},{"issue":"1","key":"4_CR21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"PC Kanellakis","year":"1990","unstructured":"Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. Inf. Comput. 86(1), 43\u201368 (1990). \n                      https:\/\/doi.org\/10.1016\/0890-5401(90)90025-D","journal-title":"Inf. Comput."},{"issue":"7","key":"4_CR22","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"RM Keller","year":"1976","unstructured":"Keller, R.M.: Formal verification of parallel programs. Commun. ACM 19(7), 371\u2013384 (1976). \n                      https:\/\/doi.org\/10.1145\/360248.360251","journal-title":"Commun. ACM"},{"issue":"2-3","key":"4_CR23","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0304-3975(90)90038-J","volume":"72","author":"Kim G. 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). \n                      https:\/\/doi.org\/10.1016\/0304-3975(90)90038-J\n                      \n                    . \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/030439759090038J","journal-title":"Theoretical Computer Science"},{"key":"4_CR24","unstructured":"Loemker, L.E. (ed.): G. W. Leibniz: Philosophical Papers and Letters, 2nd edn. D. Reidel, Dordrecht (1969)"},{"key":"4_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communicating Systems. Springer, Heidelberg (1980). \n                      https:\/\/doi.org\/10.1007\/3-540-10235-3"},{"key":"4_CR26","unstructured":"Morris, J.H.: Lambda-calculus models of programming languages. Ph.D. thesis, Massachusetts Institute of Technology (1968)"},{"issue":"3","key":"4_CR27","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0304-3975(87)90117-4","volume":"50","author":"Iain Phillips","year":"1987","unstructured":"Phillips, I.: Refusal testing. Theor. Comput. Sci. 50(3),241\u2013284 (1987). \n                      https:\/\/doi.org\/10.1016\/0304-3975(87)90117-4\n                      \n                    . \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/0304397587901174","journal-title":"Theoretical Computer Science"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time: preliminary report. In: Aho, A.V., et al. (eds.) Proceedings of the 5th Annual ACM Symposium on Theory of Computing, pp. 1\u20139. ACM (1973). \n                      https:\/\/doi.org\/10.1145\/800125.804029","DOI":"10.1145\/800125.804029"},{"key":"4_CR29","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0304-3975(84)90112-9","volume":"34","author":"G Winskel","year":"1984","unstructured":"Winskel, G.: Synchronization trees. Theor. Comput. Sci. 34, 33\u201382 (1984). \n                      https:\/\/doi.org\/10.1016\/0304-3975(84)90112-9","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Models, Languages, and Tools for Concurrent and Distributed Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21485-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T10:11:22Z","timestamp":1562148682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21485-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030214845","9783030214852"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21485-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}