{'fraction_non_alphanumeric': 0.02910413824465666, 'fraction_numerical': 0.0, 'mean_word_length': 5.145251396648045, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Incremental verification of component-based timed systems

We are interested in the incremental development, by integration of components, of component-based timed systems, and in particular, in the preservation of their properties during such a development process. We model timed components with timed automata. Their composition is achieved with the classic parallel composition operator for timed automata. The specifications of these timed systems are expressed with the timed linear logic Metric Interval Temporal Logic (MITL). To guarantee the preservation of properties during an incremental development process, we propose to use τ-simulation relations, adapted for timed systems. First, we extend the classic notion of τ-simulation with timed aspects. As in the untimed case, this relation, called timed τ-simulation, preserves safety properties. To preserve more properties, in particular liveness ones, we present another relation, called divergence-sensitive and stability-respecting (DS) timed τ-simulation. This last relation preserves all MITL properties (and thus liveness ones), but also strong non-zenoness and deadlock-freedom. Moreover, as we put ourselves in a component-based framework, we study if the relations are appropriate to the use of the composition operator that we consider. For this purpose, we study if the relations are compatible with this operator, and if composability and compositionality hold. These three properties are a way to reduce the cost of the verification of the preservation, or even to get it for free. It results that the timed τ-simulation is appropriate with the classic operator since the properties hold without any assumption. However, this is not the case for the DS timed τ-simulation. We implemented the algorithmic verification of the simulations in a tool called Verification of Simulation for Timed Automata (VeSTA). The structure of the tool was inspired from the one of the OPEN-KRONOS tool. This allows, as additional feature, to connect the models considered in VeSTA to the modules of the verification platform OPEN-CAESAR. We show the interest of our method by applying it on a case study, concerning a production cell example.