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

Cited literature [17 references]  Display  Hide  Download

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

Files

2002-mtcs.pdf
Publisher files allowed on an open archive

Identifiers

  • 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, pp.1-16. ⟨hal-00114682⟩

Share

Metrics

Record views

212

Files downloads

136