Incremental Language Inclusion Checking for Networks of Timed Automata

Checking the language inclusion between two models is a fundamental problem arising in application areas such as formal verification or refinement in top-down design. We propose an incremental procedure for checking the language inclusion between two real-time specifications, modeled as networks of...

Full description

Saved in:
Bibliographic Details
Published inFormal Modeling and Analysis of Timed Systems Vol. 8053; pp. 152 - 167
Main Authors Krenn, Willibald, Ničković, Dejan, Tec, Loredana
Format Book Chapter
LanguageEnglish
Published Germany Springer Berlin / Heidelberg 2013
Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Dine Philosopher
Incremental Procedure
Parallel Composition
Time Automaton
Online AccessGet full text

Cover

More Information
Summary:Checking the language inclusion between two models is a fundamental problem arising in application areas such as formal verification or refinement in top-down design. We propose an incremental procedure for checking the language inclusion between two real-time specifications, modeled as networks of deterministic timed automata, where the two specifications are equivalent up to one component. For such classes of systems we aim to improve the efficiency of the language inclusion check by exploiting the compositional nature of the problem and avoiding the explicit parallel composition of the timed automata in the network. We first develop a generic procedure that gives freedom to specific implementation choices. We then propose an instantiation of the procedure that is based on bounded model checking techniques. We illustrate the application of our approach in a case study and discuss promising experimental results.
ISBN:3642402283
9783642402289
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-40229-6_11