Skip to main navigation Skip to search Skip to main content

From model-checking to temporal logic constraint solving

  • INRIA Institut National de Recherche en Informatique et en Automatique

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 , 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.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming - CP 2009 - 15th International Conference, CP 2009, Proceedings
Pages319-334
Number of pages16
DOIs
Publication statusPublished - 2 Nov 2009
Event15th International Conference on Principles and Practice of Constraint Programming, CP 2009 - Lisbon, Portugal
Duration: 20 Sept 200924 Sept 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5732 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15th International Conference on Principles and Practice of Constraint Programming, CP 2009
Country/TerritoryPortugal
CityLisbon
Period20/09/0924/09/09

Fingerprint

Dive into the research topics of 'From model-checking to temporal logic constraint solving'. Together they form a unique fingerprint.

Cite this