Causal Time Calculus

Abstract : We present a process algebra suitable to the modelling of timed concurrent systems and to their efficient verification through model checking. The algebra is provided with two consistent semantics: a structural operational semantics (as usual for process algebras) and a denotational semantics in terms of Petri nets in which time is introduced through counters of explicit clock ticks. This way of modelling time has been called causal time so the process algebra is itself called the Causal Time Calculus (CTC). It was shown in a separate paper that the causal time approach allowed for efficient verification but suffered from a sensitivity to the constants to which counts of ticks are compared. We show in this paper how this weakness can be removed.
Type de document :
Communication dans un congrès
2004, Springer, pp.1-12, 2004, Lecture Notes in Computer Science
Liste complète des métadonnées

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

https://hal.archives-ouvertes.fr/hal-00114673
Contributeur : Franck Pommereau <>
Soumis le : vendredi 17 novembre 2006 - 13:21:13
Dernière modification le : jeudi 13 décembre 2018 - 09:46:03
Document(s) archivé(s) le : mardi 6 avril 2010 - 22:57:00

Fichier

2003-formats.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-00114673, version 1

Collections

Citation

Franck Pommereau. Causal Time Calculus. 2004, Springer, pp.1-12, 2004, Lecture Notes in Computer Science. 〈hal-00114673〉

Partager

Métriques

Consultations de la notice

123

Téléchargements de fichiers

47