After having modelled a system using Petri nets, the objective is to verify it satisfies some interesting properties.
	To do so, the construction of the reachability graph is introduced, which exhaustively explores all possible states of
	the system.

After having modelled a system using Petri nets, the objective is to verify it satisfies some interesting properties. To do so, the construction of the reachability graph is introduced, which exhaustively explores all possible states of the system.

S1.04 - The ReachabilityGraph for Symmetric Nets Analysis (pdf)

Nowadays, systems tend to be more and more distributed. Distribution brings a huge complexity and a strong need to
      deduce possible (good and bad) behaviours on the global system, from the known behaviour of its actors. For such
      systems, we know that classical development methods are not adequate since the coverage of possible executions is too
      low. This is an old observation that led people to investigate the use of formal methods. One good candidate for
      analysing such systems is Petri nets. More specifically, coloured Petri nets enjoy the use of a high-level language to
      describe data while the net structure captures the flow of information. Although they provide very nice means for
      modelling, their generality has the drawback of the difficulty to apply efficient analysis techniques. In this
      tutorial, we focus on symmetric nets which are high-level nets with a limited set of allowed data types, allowing for
      efficient state space analysis. We also tackle their extension to symmetric nets with bags for which analysis can still
      be applied. The tutorial presents the underlying theory, the verification approaches, typical applications, and
      puts these into practice through hands-on sessions using the CosyVerif verification environment.

Nowadays, systems tend to be more and more distributed. Distribution brings a huge complexity and a strong need to deduce possible (good and bad) behaviours on the global system, from the known behaviour of its actors. For such systems, we know that classical development methods are not adequate since the coverage of possible executions is too low. This is an old observation that led people to investigate the use of formal methods. One good candidate for analysing such systems is Petri nets. More specifically, coloured Petri nets enjoy the use of a high-level language to describe data while the net structure captures the flow of information. Although they provide very nice means for modelling, their generality has the drawback of the difficulty to apply efficient analysis techniques. In this tutorial, we focus on symmetric nets which are high-level nets with a limited set of allowed data types, allowing for efficient state space analysis. We also tackle their extension to symmetric nets with bags for which analysis can still be applied. The tutorial presents the underlying theory, the verification approaches, typical applications, and puts these into practice through hands-on sessions using the CosyVerif verification environment.

Share S1.04 - The ReachabilityGraph for Symmetric Nets Analysis (pdf)

Sign up to save your podcasts

S1.04 - The ReachabilityGraph for Symmetric Nets Analysis (pdf)

S1.04 - The ReachabilityGraph for Symmetric Nets Analysis (pdf)