Skip to Main content Skip to Navigation
Journal articles

Periodicity Based Decidable Classes in a First Order Timed Logic

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Danièle Beauquier Connect in order to contact the contributor
Submitted on : Tuesday, November 28, 2006 - 9:28:45 PM
Last modification on : Tuesday, October 19, 2021 - 4:06:39 PM
Long-term archiving on: : Tuesday, April 6, 2010 - 8:11:29 PM


Publisher files allowed on an open archive


  • HAL Id : hal-00116950, version 1



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



Record views


Files downloads