Verification of real-time designs: Combining scheduling theory with automatic formal verification

We present an automatic approach to verify designs of real- Time distributed systems for complex timing requirements. We focus our analysis on designs which adhere to the hypothesis of analytical theory for Fixed-Priority scheduling. Unlike previous formal approaches, we draw from that theory and bu...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Braberman, V.A., Felder, M.
Formato: SER
Materias:
Analytical theory
Automatic approaches
Distributed systems
Fixed-priority scheduling
Formal verifications
Model checking tools
Scheduling analysis
Timing requirements
Automata theory
Design
Model checking
Scheduling
Software engineering
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03029743_v1687LNCS_n_p494_Braberman
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
Descripción
Sumario:We present an automatic approach to verify designs of real- Time distributed systems for complex timing requirements. We focus our analysis on designs which adhere to the hypothesis of analytical theory for Fixed-Priority scheduling. Unlike previous formal approaches, we draw from that theory and build small formal models (based on Timed Automata) to be analyzed by means of model checking tools. We are thus integrating scheduling analysis into the framework of automatic formal verification. © Springer-Verlag Berlin Heidelberg 1999.

Ejemplares similares