Learning Transition Rules from Temporal Logic Properties - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2005

Learning Transition Rules from Temporal Logic Properties

Francois Fages
Sylvain Soliman
Laurence Calzone


Most of the work on temporal representation issues in Machine Learning deals with the problem of learning/mining temporal patterns from a large set of temporal data. In this paper we investigate the somewhat different problem of learning the behavioral rules of a system from its observed temporal properties formalized in temporal logic. Our interest in this problem arose from Systems Biology and the development of machine learning techniques for learning biochemical reaction rules and kinetic parameters in the Biochemical Abstract Machine BIOCHAM. Our contribution is twofold. First, in the general setting of Kripke structures and concurrent transition systems, we define positive and negative CTL formulae and propose a theory revision algorithm for learning transition rules from a CTL specification. Second, in the setting of hybrid systems which add a continuous dynamics described by differential equations, we show how a similar algorithm can be built to learn parameter values from a constraint LTL specification. In the context of BIOCHAM, which is used as a running example in this paper, we report evaluation results showing the usefulness of this approach and encouraging performance figures.
Fichier principal
Vignette du fichier
RR-5543.pdf (342.36 Ko) Télécharger le fichier

Dates and versions

inria-00070464 , version 1 (19-05-2006)


  • HAL Id : inria-00070464 , version 1


Nathalie Chabrier-Rivier, Francois Fages, Sylvain Soliman, Laurence Calzone. Learning Transition Rules from Temporal Logic Properties. [Research Report] RR-5543, INRIA. 2005, pp.19. ⟨inria-00070464⟩
214 View
240 Download


Gmail Facebook Twitter LinkedIn More