Petri nets with causal time for system verification

Abstract : We present a new approach to the modelling of time constrained systems. It is based on untimed high-level Petri nets using the concept of causal time. With this concept, the progression of time is modelled in the system by the occurrence of a distinguished event, tick, which serves as a reference to the rest of the system. In order to validate this approach as suitable for automated verification, a case study is provided and the results obtained using a model-checker on high-level Petri nets are compared with those obtained for timed automata using prominent tools. The comparison is encouraging and shows that the causal time approach is intuitive and modular. It also potentially allows for efficient verification.
Type de document :
Communication dans un congrès
2003, Elsevier, pp.1-16, 2003, Electronic Notes in Theoretical Computer Science 68(5)
Liste complète des métadonnées

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

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

Fichiers

2002-mtcs.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-00114682, version 1

Collections

Citation

Cécile Bui Thanh, Hanna Klaudel, Franck Pommereau. Petri nets with causal time for system verification. 2003, Elsevier, pp.1-16, 2003, Electronic Notes in Theoretical Computer Science 68(5). 〈hal-00114682〉

Partager

Métriques

Consultations de la notice

209

Téléchargements de fichiers

125