No abstract

This paper reports our experiences with using an extension of timed automata [1] for schedulability analysis of prototype implementations. The approach builds upon requirements specifications constructed using the formal real-time specification language Astral [7]. Astral specifications are translated into extended timed automata. The resulting automata are augmented with implementation details like assignment of processes to processors, priorities, worst-case execution times of operations, and scheduling policies. Schedulability analysis is then performed by (automated) formal verification of the extended automaton.

No abstract

This paper discusses model checking of real-time systems. A novel aspect of our approach is the unconventional approach to deal with representing symbolic state spaces. The representation does not use a canonical form for representing symbolic nodes. Instead it applies an alternative representation based on splitting trees. Unlike often used canonical representations, this representation is tailored for the type of exploration algorithm that we apply, namely an algorithm based on partition refinement.

No abstract