A symbolic model for timed concurrent constraint programming

Abstract : Concurrent Constraint Programming (ccp) is a model for concurrency where agents interact with each other by telling and asking constraints (i.e., formulas in logic) into a shared store of partial information. The ntcc calculus extends ccp with the notion of discrete time-units for the specification of reactive systems. Moreover, ntcc features constructors for non-deterministic choices and asynchronous behavior, thus allowing for (1) synchronization of processes via constraint entailment during a time-unit and (2) synchronization of processes along time-intervals. In this paper we develop the techniques needed for the automatic verification of ntcc programs based on symbolic model checking. We show that the internal transition relation, modeling the behavior of processes during a time-unit (1 above), can be symbolically represented by formulas in a suitable fragment of linear time temporal logic. Moreover, by using standard techniques as difference decision diagrams, we provide a compact representation of these constraints. Then, relying on a fixpoint characterization of the timed constructs, we obtain a symbolic model of the observable transition (2 above). We prove that our construction is correct with respect to the operational semantics. Finally, we introduce a prototypical tool implementing our method.
Type de document :
Communication dans un congrès
Ninth Workshop on Logical and Semantic Frameworks, with Applications (LSFA 2014), Sep 2014, Brasilia, Brazil. 312, pp.161-177, 2015, Electronic Notes in Theoretical Computer Science. 〈10.1016/j.entcs.2015.04.010〉
Liste complète des métadonnées

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

https://hal.archives-ouvertes.fr/hal-01257078
Contributeur : Arias Jaime <>
Soumis le : mardi 22 septembre 2015 - 14:57:20
Dernière modification le : mercredi 14 novembre 2018 - 16:12:05
Document(s) archivé(s) le : mardi 29 décembre 2015 - 09:19:41

Fichier

lsfa-2.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Jaime Arias, Michell Guzmán, Carlos Olarte. A symbolic model for timed concurrent constraint programming. Ninth Workshop on Logical and Semantic Frameworks, with Applications (LSFA 2014), Sep 2014, Brasilia, Brazil. 312, pp.161-177, 2015, Electronic Notes in Theoretical Computer Science. 〈10.1016/j.entcs.2015.04.010〉. 〈hal-01257078v2〉

Partager

Métriques

Consultations de la notice

288

Téléchargements de fichiers

81