An approach by graphs for the recognition of temporal scenarios

This paper presents an approach by graphs for the recognition of temporal scenarios, that represent models of the dynamical behavior of a system. The aim of the presented work is to analyze the relative situation of a scenario and an effective behavior of the system, called a session. Different symbolic levels of recognition are proposed to qualify this status. All these levels, as well as most of the properties, are formulated in terms of graphs of temporal constraints. Different contexts are analyzed, where the session is either statically built, when considered as a history, or dynamically built, when information is treated in an incremental manner or on-line. In a second phase, each status is refined using a numeric estimation of the proximity between a scenario and a session. This estimation is performed by calculating an overlapping index or a temporal difference index between the volumes of the domains corresponding to the temporal graphs of the scenario and the session