By Topic

Query-driven petri net reduction for analysis in Ada tasking

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

3 Author(s)
Shengru Tu ; Dept. of Comput. Sci., New Orleans Univ., LA, USA ; Wang, Y.-T. ; Mathews, M.E.

We have illustrated methods to address three types of problems in static analysis for Ada tasking: quantitative questions, safety problems and MAY-happen event problems. We have applied a two-phase methodology to automate analysis: first deriving a semantically rich model independent of any specific analysis issue, that is the original Ada nets, and then manipulating this model with algorithms that are designed for the specific analysis issue of concern. We call such a methodology the query-driven net reduction. The philosophy behind this methodology is that different analyses demand different aspects of information from the system. An optimized analysis model should only contain the necessary information. In addition to reachability graph generation, the linear algebraic method is also investigated as a follow-up analysis technique. Experiments show that the net reduction technique substantially enhances the analysis ability of both state space generation approaches and linear algebraic methods

Published in:

Computers and Communications, 1995., Conference Proceedings of the 1995 IEEE Fourteenth Annual International Phoenix Conference on

Date of Conference:

28-31 Mar 1995