Verificació de sistemes concurrents basada en Constraint-Programming

L'objectiu d'aquest projecte és la verificació de propietats temporals LTL en sistemes concurrents modelats amb xarxes de Petri mitjançant constraint programming

Verificació de sistemes concurrents basada en Constraint-Programming

L'objectiu d'aquest projecte és la verificació de propietats temporals LTL en sistemes concurrents modelats amb xarxes de Petri mitjançant constraint programming

Verification of Parallel Systems using Constraint Programming

. Liveness properties of parallel systems usually specify that in every execution certain states are eventually reached. Therefore, violation of such a property can only be detected in infinite executions. In this paper we introduce a semi-decision method that is based on structural Petri net analysis and makes use of the constraint programming paradigm. By a semi-decision method we understand a procedure which may answer `yes', so that in this case the parallel system satisfies the property, or `don't know'. We give an implementation of our method in terms of the constraint programming tool 2lp. An application of our approach to a snapshot algorithm demonstrates how constraint programming can beat classical exact methods such as model checking. Keywords: Verification, Petri nets, constraint programming, finite-state systems. 1 Introduction In the field of verification the automatic verification of finite-state parallel systems has become a very interesting and important aspect of co..