Skoči na glavni sadržaj

Izvorni znanstveni članak

https://doi.org/10.2498/cit.1001272

Verification of Complex Real-time Systems using Rewriting Logic

Mustapha Bourahla


Puni tekst: engleski pdf 320 Kb

str. 265-284

preuzimanja: 495

citiraj


Sažetak

This paper presents a method for model checking dense complex real-time systems. This approach is implemented at the meta level of the Rewriting Logic system Maude. The dense complex real-time system is specified using a syntax which has the semantics of timed automata and the property is specified with the temporal logic TLTL (Timed LTL). The well known timed automata model checkers Kronos and Uppaal only support TCTL model checking (a very limited fragment in the case of Uppaal). Specification of the TLTL property is reduced to LTL and its temporal constraints are captured in a new timed automaton. This timed automaton will be composed with the original timed automaton representing the semantics of the complex real-time system under analysis. Then, the product timed automaton will be abstracted using partition refinement of state space based on strong bi-simulation. The result is an untimed automaton modulo the TLTL property which represents an equivalent finite state system to be model checked using Maude LTL model checking. This approach is successfully tested on industrial designs.

Ključne riječi

Hrčak ID:

44865

URI

https://hrcak.srce.hr/44865

Posjeta: 834 *