Observation strategies for event detection with incidence on runtime verification: theory, algorithms, experimentation

DOI10.1007/S10472-011-9259-5zbMath1252.68128OpenAlexW1982951486WikidataQ62038912 ScholiaQ62038912MaRDI QIDQ421476

Luís Moniz Pereira, Pierangelo Dell'Acqua, Marco Alberti

Publication date: 23 May 2012

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11392/1871928

zbMATH Keywords

complexitytemporal logiclogic programmingevent detectionruntime verification

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Uses Software

• ACORDA
• SCIFF

Cites Work

• Unnamed Item
• Wavelet-neural network model for automatic traffic incident detection
• Characterizing diagnoses and systems
• A brief account of runtime verification
• Preferential theory revision
• Algorithmic construction of sets for k -restrictions
• Comparing LTL Semantics for Runtime Verification
• Abduction in well-founded semantics and generalized stable models via tabled dual programs
• Abductive Logic Programming
• Verification from Declarative Specifications Using Logic Programming
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: Observation strategies for event detection with incidence on runtime verification: theory, algorithms, experimentation