𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Petri nets with causal time for system verification

✍ Scribed by C. Bui Thanh; H. Klaudel; F. Pommereau


Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
209 KB
Volume
68
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

✦ Synopsis


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.


πŸ“œ SIMILAR VOLUMES


A causal semantics for time Petri nets
✍ Tuomas Aura; Johan Lilius πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 463 KB

The objective of this work is to give time Petri nets a partial order semantics, akin to the nonsequential processes of untimed net systems. To this end a time process of a time Petri net is deΓΏned as a traditionally constructed causal process with a valid timing. A timing is a labelling that attach

Real-Time Systems || Timed Petri Nets
✍ Cheng, Albert M. K. πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley & Sons, Inc. βš– 171 KB πŸ‘ 2 views

## TIMED PETRI NETS Petri nets were developed as an operational formalism for specifying untimed concurrent systems. They can show concurrent activities by depicting control and data flows in different parts of the modeled system. As an operational formalism, a Petri net gives a dynamic representa