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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00114673
Contributor : Franck Pommereau <>
Submitted on : Friday, November 17, 2006 - 1:21:13 PM
Last modification on : Thursday, December 13, 2018 - 9:46:03 AM
Document(s) archivé(s) le : Tuesday, April 6, 2010 - 10:57:00 PM

File

2003-formats.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00114673, version 1

Collections

Citation

Franck Pommereau. Causal Time Calculus. 2004, pp.1-12. ⟨hal-00114673⟩

Share

Metrics

Record views

125

Files downloads

47