Modeling and Verification for Timing Satisfaction of Fault-Tolerant Systems with Finiteness release_gaqprusonzeajb7ipoc73lghxu

by Chih-Hong Cheng, Christian Buckl, Javier Esparza, Alois Knoll

Released as a article .

2009  

Abstract

The increasing use of model-based tools enables further use of formal verification techniques in the context of distributed real-time systems. To avoid state explosion, it is necessary to construct verification models that focus on the aspects under consideration. In this paper, we discuss how we construct a verification model for timing analysis in distributed real-time systems. We (1) give observations concerning restrictions of timed automata to model these systems, (2) formulate mathematical representations on how to perform model-to-model transformation to derive verification models from system models, and (3) propose some theoretical criteria how to reduce the model size. The latter is in particular important, as for the verification of complex systems, an efficient model reflecting the properties of the system under consideration is equally important to the verification algorithm itself. Finally, we present an extension of the model-based development tool FTOS, designed to develop fault-tolerant systems, to demonstrate %the benefits of our approach.
In text/plain format

Archived Files and Locations

application/pdf  305.5 kB
file_p65aen7gfnchfb3qrz5vct4ehu
arxiv.org (repository)
www6.in.tum.de (web)
web.archive.org (webarchive)
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   accepted
Date   2009-10-21
Version   v3
Language   en ?
arXiv  0905.3951v3
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 6ab93adf-ec7d-4a80-b7fc-506452fb4279
API URL: JSON