Efficient computation of quantitative properties of real-time preemptive systems
by Abdelli Abdelkrim
International Journal of Critical Computer-Based Systems (IJCCBS), Vol. 3, No. 3, 2012

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.

Online publication date: Sat, 16-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Critical Computer-Based Systems (IJCCBS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com