Reliability analysis of discrete event dynamic systems with Petri nets

摘要

This paper deals with dynamic reliability of embedded systems. It presents a method for deriving feared scenarios (which might lead the system to a critical situation) in Petri nets. A classical way to obtain scenarios in Petri nets is to generate the reachability graph. However, for complex systems, it leads to the state space explosion. To avoid this problem, in our approach, Petri net reachability is translated into provability of linear logic sequents. Linear logic bases are introduced and used to formally define scenarios and minimality of scenarios. These definitions allow the method to produce only pertinent scenarios. The steps of the method are described and illustrated through a landing-gear system example.