A Decidability Result for the Model Checking of Infinite-State Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Automated Reasoning Year : 2010

A Decidability Result for the Model Checking of Infinite-State Systems

Abstract

We present a decidability result for the model checking of a certain class of properties that can be conveniently expressed as ground formulae of a first-order temporal fragment. The decidability result is obtained by importing into the context of model-checking problems some techniques developed for the combination of decision procedures for the satisfiability of constraints. The general decidability result is then specialized for checking properties of particular interest, such as liveness and safety, and, for the latter case, a more optimized algorithm has been proposed.

Dates and versions

inria-00576873 , version 1 (15-03-2011)

Identifiers

Cite

Daniele Zucchelli, Enrica Nicolini. A Decidability Result for the Model Checking of Infinite-State Systems. Journal of Automated Reasoning, 2010, (Online), ⟨10.1007/s10817-010-9192-z⟩. ⟨inria-00576873⟩
91 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More