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

Abstract

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.<>