Title: Efficient computation of quantitative properties of real-time preemptive systems

Authors: Abdelli Abdelkrim

Addresses: LSI Laboratory, Computer Science Department, USTHB University, Bp 32 EL ALIA Babezzouar, Algiers 16111, Algeria

Abstract: We propose in this paper an algorithm making it possible an efficient time analysis of the state space of preemptive real-time systems modelled using time Petri nets with inhibitor arcs. For this effect, we discuss how to determine linear and quantitative properties of the remote model from its reachability graph. Then, we propose an algorithm to compute an approximation of the minimal and the maximal time distances of any firing sequence. Contrarily to other techniques, our algorithm enjoys a linear complexity time cost and can be performed on the fly when building the reachability graph without requiring to extend the original model with observers.

Keywords: quantitative properties; preemptive systems; scheduling; difference bound matrix; DBM; timed Petri nets; inhibitor arcs; stopwatch; approximation; state class graph; polyhedra; real-time systems; time analysis; state space; modelling; reachability graphs.

DOI: 10.1504/IJCCBS.2012.050300

International Journal of Critical Computer-Based Systems, 2012 Vol.3 No.3, pp.187 - 209

Received: 08 Feb 2011
Accepted: 06 Feb 2012
Published online: 16 Aug 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article