By Topic

Splitting reachability analysis in hybrid automata

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

2 Author(s)
P. Boisieau ; IRCyN, Nantes, France ; O. Roux

Within the framework of time verification of real time systems, we present a new technique for the reachability analysis of hybrid automata. We call this technique the “Splitting Reachability Analysis”. It is applied to a synchronized product of hybrid automata. The basic idea is to compute separately and simultaneously states sets in each component of a synchronized product of hybrid automata. The composition of these sets is an upper-approximation of the reachable states set of the synchronized product. Compared to a classical technique, the benefit, shown through with the example of the Fischer mutual exclusion protocol, is to reduce the costs in memory and computation time

Published in:

Real-Time Systems, 1999. Proceedings of the 11th Euromicro Conference on

Date of Conference: