Timed automata approach to real time distributed system verification
Authors:
- J. KrakoraJKJ. Krakora
- L. WaszniowskiLWL. Waszniowski
- P. PisaPPP. Pisa
- Z. HanzalekZHZ. Hanzalek
- 28 February 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 407-410
Abstract
This article deals with a distributed real-time applica- tion modelling by timed automata. The application under consideration consists of several processors communicat- ing via Controller Area Network (CAN); each processor executes an application that consists of tasks running un- der an operating system (e.g. OSEK) and using inter-task synchronizationprimitives. For such system, model check- ing algorithm implemented in a model checking tool (e.g. UPAALL) can be used to verify complex time and logi- cal properties of the proposed model (e.g. end-to-end re- sponse time, state reachability, deadlock freeness). Since the proposed timed automata model contains more crucial details of the system behavior with respect to classical approaches to the response time analysis, the model checking approach provides less pessimistic results in many cases.Keywords
This publication has 4 references indexed in Scilit:
- Schedulability analysis for tasks with static and dynamic offsets2002
- Systems and Software Verification2001
- Keynote paper: A performance analysis of a hard real-time systemControl Engineering Practice, 1995
- A theory of timed automataTheoretical Computer Science, 1994