Backward Reachability Analysis of Colored Petri Nets

Mohamed Bouali (1) , Jérôme Rocheteau (2) , Pavol Barger (1)

1 Heudiasyc - Heuristique et Diagnostic des Systèmes Complexes [Compiègne]
2 PPS - Preuves, Programmes et Systèmes

This paper deals with a formal method for the study of the backward reachability analysis applied on Colored Petri Nets (CPN). The proposed method proceeds in two steps : 1) it translates CPN to terms of the Multiplicative Intuitionistic Linear Logic (MILL); 2) it proves sequents by constructing proof trees. The translation from CPN to MILL must respect some properties such as the semantic associated to tokens. That is why, the First-Order MILL (MILL1) is used for translation. The reachability between two markings, the initial marking and the final marking, is expressed by a sequent which can be proven (if the initial marking is backward-reachable from the final one) using first-order terms unification and/or marking enhancement.

Domaines: Modélisation et simulation

Mohamed Bouali, Jérôme Rocheteau, Pavol Barger. Backward Reachability Analysis of Colored Petri Nets. The European Safety and Reliability Conference (ESREL'09), Sep 2009, Prague, Czech Republic. pp.1975--1981. ⟨hal-00447509⟩