Periodicity Based Decidable Classes in a First Order Timed Logic

Danièle Beauquier (1) , Anatol Slissenko (1)

1 LACL - Laboratoire d'Algorithmique Complexité et Logique

We describe a decidable class of formulas in a first order timed logic that covers a good amount of properties of real-time distributed systems. Earlier we described a decidable class based on some finiteness properties, and sketched a decidable class in a weaker logic that captures periodicity properties, though without complete proof. The new feature of the decidable class presented here is to be able to treat parametric properties, in particular, properties that concern an arbitrary number of processes as compared to the just mentioned class that could express only properties for a fixed, explicitly given number of processes. As before the properties may use non-trivial arithmetics. We also state another important feature of the class: if a verification formula is not true then our algorithm gives a quantifier-free description of all its counter-models of the complexity involved in the definition of the decidable class and that is quite representative. In conclusion we discuss theoretical and practical issues of the complexity and some open questions.

Domaines: Logique en informatique [cs.LO]

Danièle Beauquier, Anatol Slissenko. Periodicity Based Decidable Classes in a First Order Timed Logic. Annals of Pure and Applied Logic, 2006, 139, pp.43--73. ⟨hal-00116950⟩