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.
CITATION STYLE
Braberman, V. A., & Felder, M. (1999). Verification of real-time designs: Combining scheduling theory with automatic formal verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1687 LNCS, pp. 494–510). Springer Verlag. https://doi.org/10.1007/3-540-48166-4_30
Mendeley helps you to discover research relevant for your work.