On-the-fly TCTL model checking for Time Petri Nets using state class graphs

  • Authors:
  • Rachid Hadjidj;Hanifa Boucheneb

  • Affiliations:
  • Ecole Polytechnique de Montreal, Canada;Ecole Polytechnique de Montreal, Canada

  • Venue:
  • ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper shows how to efficiently model check a subclass of TCTL properties for the TPN model, using the so called state class method. The idea is to put the TPN model under analysis in parallel with a special TPN to capture relevant time events to verify a timed property. The special TPN, we call Alarm-clock, has two transitions, with special firing priorities, which can be set to fire at special moments. The verification of a timed property is based on a forward on-the-fly exploration technique, augmented with an abstraction by inclusion to further attenuate the state explosion problem. We prove the decidability of our verification technique for bounded TPN models and give some experimental results to show the effectiveness of our verification technique.