Model checking duration calculus: A practical approach

17Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Model checking of real-time systems with respect to Duration Calculus (DC) specifications requires the translation of DC formulae into automata-based semantics. This task is difficult to automate. The existing algorithms provide a limited DC coverage and do not support compositional verification. We propose a translation algorithm that advances the applicability of model checking tools to real world applications. Our algorithm significantly extends the subset of DC that can be handled. It decomposes DC specifications into sub-properties that can be verified independently. The decomposition bases on a novel distributive law for DC. We implemented the algorithm as part of our tool chain for the automated verification of systems comprising data, communication, and real-time aspects. Our translation facilitated a successful application of the tool chain on an industrial case study from the European Train Control System (ETCS). © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Meyer, R., Faber, J., & Rybalchenko, A. (2006). Model checking duration calculus: A practical approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4281 LNCS, pp. 332–346). Springer Verlag. https://doi.org/10.1007/11921240_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free