By Topic

Symbolic model checking for real time systems using difference typed decision graphs

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
$31 $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)
Ayadi, S. ; FST, Tunisia ; Robbana, R.

Summary form only given. In symbolic model checking of untimed systems, the general approach is based on BDDs (Binary Decision Diagrams) representation. Concurrently, TDGs (typed Decision Graphs) were proposed in another context, bring a better profit of capacity memory. However, the symbolic method do not easily generalize to models that contain variables ranging over noncountable domains like for example real-time systems where time is modeled using continuous real variables and the behavior of a system is specified using constraints on these variables. To solve the reachability problem for a timed system, there are very few results on how model checking is efficient, such as the technique of DDDs (Difference Decision Diagrams) representing difference constraints on clocks. But, it remains an open problem to find algorithms and data structures that work just as well for timed systems as BDDs do for untimed systems. We present a methodology for the symbolic model checker using a new technique of representation of timed systems: the DTDGs, Difference Typed Decision Graphs that is a combination of TDGs and DDDs. Then, our approach consists in analyzing timed systems symbolically, and describe the corresponding data structure (DTDGs) for representing the state space of a timed system. For that, we use timed graphs for the modelling of timed systems. This result allows us to analyse timed systems with both the discrete part of states and the associated timing information. Hence the motivation is about symbolic model checking for timed systems based on difference typed decision graphs.

Published in:

Computer Systems and Applications, 2003. Book of Abstracts. ACS/IEEE International Conference on

Date of Conference:

14-18 July 2003