Back to first pageBack to first page Centre for Artificial Intelligence of UNL
Browse our site
You are here:

Publication details

Go back
Publication details
Main information
Observation Strategies for Event Detection with Incidence on Runtime Verificationl
June 2010
OSEDIRV
In many applications, it is required to detect the occurrence of an event in a system, which entails observing the system. Observation can be costly, so it makes sense to try and reduce the number of observations, without losing certainty about the event’s occurrence. In this paper, we propose a formalization of the problem. We show (formally) that when the event to be detected follows a discrete spatial or temporal pattern, it is possible to reduce the number of observations. We provide an experimental evaluation of algorithms for this purpose. We apply the result to verification of linear temporal logics formulæ. Finally, we discuss possible generalizations, and how event detection and related applications can benefit from logic programming techniques.
In proceedings
Marco Alberti, P. Dell'Acqua, Luís Moniz Pereira
Marco Gavanelli, Toni Mancini
RCRA-2010 Experimental evaluation of algorithms for solving problems with combinatorial explosion
http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/
CEUR Workshop Proceedings
http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-616/
616
-
-
1613-0073
http://centria.di.fct.unl.pt/~lmp/publications/online-papers/runtime_verification.pdf
http://CEUR-WS.org/Vol-616/paper03.pdf
Export formats
Marco Alberti and P. Dell'Acqua and Luís Moniz Pereira, Observation Strategies for Event Detection with Incidence on Runtime Verificationl, in: Marco Gavanelli and Toni Mancini (eds), RCRA-2010 Experimental evaluation of algorithms for solving problems with combinatorial explosion, http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/, CEUR Workshop Proceedings, http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-616/, Vol. 616, ISSN 1613-0073, (http://CEUR-WS.org/Vol-616/paper03.pdf), http://centria.di.fct.unl.pt/~lmp/publications/online-papers/runtime_verification.pdf, June 2010.
<a href="/people/members/view.php?code=bde07d722513741a0fa20a19209bc4a1" class="author">Marco Alberti</a>, <a href="/people/members/view.php?code=c3899b9bc15364381381c58d138af552" class="author">P. Dell'Acqua</a> and <a href="/people/members/view.php?code=6175f826202ff877fba2ad77784cb9cb" class="author">Luís Moniz Pereira</a>, <b>Observation Strategies for Event Detection with Incidence on Runtime Verificationl</b>, in: Marco Gavanelli and Toni Mancini (eds), <u>RCRA-2010 Experimental evaluation of algorithms for solving problems with combinatorial explosion</u>, http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/, CEUR Workshop Proceedings, http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-616/, Vol. 616, ISSN 1613-0073, (<a href="http://CEUR-WS.org/Vol-616/paper03.pdf" target="_blank">url</a>), <i>http://centria.di.fct.unl.pt/~lmp/publications/online-papers/runtime_verification.pdf</i>, June 2010.
@inproceedings {OSEDIRV, author = {Marco Alberti and P. Dell'Acqua and Lu\'{\i}s Moniz Pereira}, editor = {Marco Gavanelli and Toni Mancini}, title = {Observation Strategies for Event Detection with Incidence on Runtime Verificationl}, booktitle = {RCRA-2010 Experimental evaluation of algorithms for solving problems with combinatorial explosion}, series = {http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/}, publisher = {CEUR Workshop Proceedings}, address = {http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-616/}, volume = {616}, issn = {1613-0073}, note = {http://centria.di.fct.unl.pt/~lmp/publications/online-papers/runtime_verification.pdf}, url = {http://CEUR-WS.org/Vol-616/paper03.pdf}, abstract = {In many applications, it is required to detect the occurrence of an event in a system, which entails observing the system. Observation can be costly, so it makes sense to try and reduce the number of observations, without losing certainty about the event’s occurrence. In this paper, we propose a formalization of the problem. We show (formally) that when the event to be detected follows a discrete spatial or temporal pattern, it is possible to reduce the number of observations. We provide an experimental evaluation of algorithms for this purpose. We apply the result to verification of linear temporal logics formulæ. Finally, we discuss possible generalizations, and how event detection and related applications can benefit from logic programming techniques.}, keywords = {Observation strategies, Event detection, runtime verification}, month = {June}, year = {2010}, }
Publication's urls
/publications/view.php?code=6fb3cf241212d881743d2e45b5b2800b
/publications/view.php?code=OSEDIRV
Go back
Centre for Artificial Intelligence of UNL
Departamento de Informática, FCT/UNL
Quinta da Torre 2829-516 CAPARICA - Portugal
Tel. (+351) 21 294 8536 FAX (+351) 21 294 8541

Fundacao_FCT