Grigore, Radu, Kiefer, Stefan (2018) Selective Monitoring. In: Leibniz International Proceedings in Informatics. 20. LIPICS, Germany (doi:10.4230/LIPIcs.CONCUR.2018.20) (KAR id:67553)
|
PDF
Publisher pdf
Language: English 
This work is licensed under a Creative Commons Attribution 4.0 International License.
|
|
|
Download (385kB)
Preview
|
Preview |
|
This file may not be suitable for users of assistive technology.
Request an accessible format
|
|
| Official URL http://dx.doi.org/110.4230/LIPIcs.CONCUR.2018.20 |
|
Abstract
We study selective monitors for labelled Markov chains. Monitors observe the outputs that are
A monitor is selective if it skips observations in order to reduce monitoring overhead. We are
undecidability result for selectively monitoring general Markov chains. On the other hand, we
in) that simple optimal monitors exist and can be computed efficiently, based on DFA language
chain. We report on experiments where we compute these monitors for several open-source
Java projects.
| Item Type: | Conference or workshop item (Paper) |
|---|---|
| DOI/Identification number: | 10.4230/LIPIcs.CONCUR.2018.20 |
| Uncontrolled keywords: | runtime monitoring, probabilistic systems, Markov chains, automata, language equivalence |
| Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
| Depositing User: | Radu Grigore |
| Date Deposited: | 02 Jul 2018 13:50 UTC |
| Last Modified: | 16 Feb 2021 13:55 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/67553 (The current URI for this page, for reference purposes) |
| Grigore, Radu: |  https://orcid.org/0000-0003-1128-0311 |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Altmetric
Altmetric
