By Topic

Linear programming supporting Ada-tasking static analysis: a Petri net approach

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)
Shengru Tu ; Dept. of Comput. Sci., New Orleans Univ., LA, USA ; Wei Sun

Basing on the algebraic representation of Petri net models of Ada tasking programs, the authors have defined a set of linear programming problems to support the static analysis of various queries about tasking behavior, such as queries about deadlock existence, possible parallelism, possible occurrence of an event, reachable states, definite occurrence of events, and quantitative questions. The linear programming problems are defined in such a way that their solutions can be used to guide net simulation to confirm the analysis conclusion. The stress of this method is that the enumeration of the entire state space of a Petri net is avoided. The defined problems are valid as long as the underlying net model is a safe net

Published in:

Proceedings Fourth International Conference on Software Engineering and Knowledge Engineering

Date of Conference:

15-20 Jun 1992