Improving the construction of the DBM over approximation of the state spce of real-time preemptive systems
AbstractWe present in this paper an algorithm allowing an efficient computation of the tightest DBM over-approximation of the state space of preemptive systems modeled by using Time Petri Nets with inhibitor arcs. First of all, we propose an algorithm that reduces the effort of computing the tightest DBM over-approximated graph. For this effect, each class of this graph is expressed as a pair (M, D), where M is a marking and D is the system of all DBM inequalities even the redundant ones. We thereby make it possible to compute the system D straightforwardly in its normal form, without requiring to compute the intermediary polyhedra. Hence, we succeed to remove the errors reported in the implementation of other DBM approximations. Then we show that by relaxing a bit in the precision of the DBM approximation, we can achieve to construct more compact graphs while reducing still more the cost of their computation. We provide for this abstraction a suitable equivalence relation that contract yet more the graphs. The experimental results comparing the defined constructions with other approaches are reported.
Download data is not yet available.
How to Cite
Abdelkrim, A. (2012). Improving the construction of the DBM over approximation of the state spce of real-time preemptive systems. Acta Cybernetica, 20(3), 347-384. https://doi.org/10.14232/actacyb.20.3.2012.1