Compositional Verification Of Parameterised Timed Systems

In this paper we address the problem of uniform verification of parameterised timed systems (PTS): "does a given safety state property hold for a system containing n identical timed components regardless of the value of n?". Our approach is compositional and consequently it suits quite well such systems in that it presents the advantage of reusing existing local characterisations at the global level of system characterisation. Additionally, we show how a direct consequence of the modelling choices adopted in our framework leads to an elegant application of the presented method to topologies such as stars and rings.