By Topic

Timed automata approach to real time distributed system verification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
J. Krakora ; Dept. of Control Eng., Czech Tech. Univ., Prague, Czech Republic ; L. Waszniowski ; P. Pisa ; Z. Hanzalek

This article deals with a distributed real-time application modelling by timed automata. The application under consideration consists of several processors communicating via controller area network (CAN): each processor executes an application that consists of tasks running under an operating system (e.g. OSEK) and using inter-task synchronization primitives. For such system, model checking algorithm implemented in a model checking tool (e.g. UPAALL) can be used to verify complex time and logical properties of the proposed model (e.g. end-to-end response 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.

Published in:

Factory Communication Systems, 2004. Proceedings. 2004 IEEE International Workshop on

Date of Conference:

22-24 Sept. 2004