On-Line detection and prediction of temporal patterns

Authors:
Shlomi Dolev;Jonathan Goldfeld;Rami Puzis
Affiliations:
Department of Computer Science, Ben-Gurion University, Beer-Sheva, Israel,Deutsche Telekom Laboratories, Ben-Gurion University, Beer-Sheva, Israel;Department of Computer Science, Ben-Gurion University, Beer-Sheva, Israel,Deutsche Telekom Laboratories, Ben-Gurion University, Beer-Sheva, Israel;Deutsche Telekom Laboratories, Ben-Gurion University, Beer-Sheva, Israel,Department of Information Systems Engineering, Ben-Gurion University, Beer-Sheva, Israel
Venue:
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
Year:
2011

Citing 9
Cited 0

Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Model-checking in dense real-time

Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Model checking

Model checking
String Matching with Constraints

MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
FoCs: Automatic Generation of Simulation Checkers from Formal Specifications

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Safety assurance via on-line monitoring

Distributed Computing
Efficient timed model checking for discrete-time systems

Theoretical Computer Science
A self-stabilizing autonomic recoverer for eventual Byzantine software

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Identifying a temporal pattern of events is a fundamental task of on-line (real-time) verification. In this work we present efficient schemes for on-line monitoring of events for identifying predefined patterns of events. The schemes use preprocessing to ensure that the number of comparisons during run-time is minimized. In particular, obsoloete sub-sequences are discarded to avoid unnecessary comparisons.We use our monitoring scheme for estimating the probability that a random suffix of a given execution will contain the pattern.