AN APPROACH BY GRAPHS FOR THE RECOGNITION OF TEMPORAL SCENARIOS

This paper presents an approach by graphs for the recognition of tempo ral scenarios, that represent models of the dynamical behavior of a sy stem. The aim of the presented work is to analyze the relative situati on of a scenario and an effective behavior of the system, called a ses sion. 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 cont exts are analyzed, where the session is either statically built, when considered as a history, or dynamically built, when information is tre ated in an incremental manner or; on-line. In a second phase, each sta tus is refined using a numeric estimation of the proximity between a s cenario and a session. This estimation is performed by calculating an overlapping index or a temporal difference index between the volumes o f the domains corresponding to the temporal graphs of the scenario and the session.