A Mobility Logic for Object Net Systems
Texte intégral
Documents relatifs
However, from the complexity point of view, better results can be obtained for structural restricted Petri nets: for example, the complexity of the reachability problem boils down
Indeed, as by-products of the pspace -completeness of PML, we show that SL satisfiability [ZL06] is pspace -complete, the fixed- point free fragment of the main logic from [SSMH04]
Unité de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unité de recherche INRIA Rhône-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT ST
Challenges for Reachability Graph Generation of Reference Nets The main challenges for a reachability graph generation tool are the definitions of a marking / state of the
If the reachability graph of a Petri net (P, { a, b } , F, M 0 ) contains a g-cycle with a non-zero Parikh vector, it has one of the seven general shapes shown in Figures 1, 3, and 5
The chosen model is a Colored Petri Net (CPN) and in this work we propose a structural analysis by backward reachability using inverse models. The CPN inver- sion is a research
The notation of Colored Petri Net noted CPN (Jensen and Rozenberg (1991)) introduces the notion of token types, namely tokens are differentiated by colors, which may be arbitrary
ABSTRACT: 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 :
