From model-checking to temporal logic constraint solving

  • Authors:
  • François Fages;Aurélien Rizk

  • Affiliations:
  • EPI Contraintes, INRIA Paris-Rocquencourt, Le Chesnay Cedex, France;EPI Contraintes, INRIA Paris-Rocquencourt, Le Chesnay Cedex, France

  • Venue:
  • CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some domain D, and by computing a validity domain for the variables rather than a truth value for the formula. This allows us to define a continuous degree of satisfaction for a temporal logic formula in a given structure, opening up the field of model-checking to optimization. We illustrate this approach with reverse-engineering problems coming from systems biology, and provide some performance figures on parameter optimization problems with respect to temporal logic specifications.