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.
Type de document :
Article dans une revue
Annals of Pure and Applied Logic, Elsevier Masson, 2006, 139, pp.43--73
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00116950
Contributeur : Danièle Beauquier <>
Soumis le : mardi 28 novembre 2006 - 21:28:45
Dernière modification le : jeudi 11 janvier 2018 - 06:19:28
Document(s) archivé(s) le : mardi 6 avril 2010 - 20:11:29

Fichier

DcdblPeriod04FebTechCorr.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-00116950, version 1

Collections

Citation

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〉

Partager

Métriques

Consultations de la notice

145

Téléchargements de fichiers

68