Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/86110| Title: | Testing equivalence vs. runtime monitoring |
| Other Titles: | Models, Languages, and Tools for Concurrent and Distributed Programming. Lecture Notes in Computer Science, vol 11665 |
| Authors: | Aceto, Luca Achilleos, Antonis Francalanza, Adrian Ingólfsdóttir, Anna Lehtinen, Karoliina |
| Keywords: | Computer software -- Verification Computer logic Object monitors (Computer software) Recursive functions -- Data processing Mathematical logic |
| Issue Date: | 2019 |
| Publisher: | Springer Nature Switzerland AG |
| Citation: | Aceto, L., Achilleos, A., Francalanza, A., Ingólfsdóttir, A., & Lehtinen, K. (2019). Testing equivalence vs. runtime monitoring. In: M. Boreale, F. Corradini, M. Loreti, & R. Pugliese (eds), Models, Languages, and Tools for Concurrent and Distributed Programming. Lecture Notes in Computer Science, vol 11665. New York City: Springer Nature Switzerland AG. |
| Abstract: | Rocco De Nicola’s most cited paper, which was coauthored with his PhD supervisor Matthew Hennessy, introduced three seminal testing equivalences over processes represented as states in labelled transition systems. This article relates those classic process semantics with the framework for runtime monitoring developed by the authors in the context of the project ‘TheoFoMon: Theoretical Foundations for Monitorability’. It shows that may-testing semantics is closely related to the basic monitoring set-up within that framework, whereas, over strongly-convergent processes, must-testing semantics is induced by a collection of monitors that can detect when processes are unable to perform certain actions. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/86110 |
| Appears in Collections: | Scholarly Works - FacICTCS |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Testing Equivalence vs. Runtime Monitoring.pdf Restricted Access | 388.08 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.