1.05 - The reachability graph for SN analysis

Update: 2014-10-08

Description

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.

Comments

In Channel

3.11 - Second Example of SNB

2014-10-0815:59

3.10 - Functions Used in SBN and Firing Rule

2014-10-0808:48

3.09 - Symmetric Nets with Bags

2014-10-0809:13

3.08 - SN and Partial Symmetries

2014-10-0809:26

3.07 - Static Subclasses

2014-10-0811:38

3.06 - The Symbolic Reachability Graph

2014-10-0808:18

3.05 - Symbolic Firing Rule

2014-10-0803:47

3.04 - Dynamic Subclasses and Symbolic Markings

2014-10-0806:54

3.03 - Symmetries to Reduce the Reachability Graph of SN

2014-10-0810:11

3.02 - Global vs Local Symmetries

2014-10-0809:33

3.01 - Opening

2014-10-0800:58

2.01 - Introduction to Practical Work

2014-10-0811:59

1.07 - CTL properties

2014-10-0814:16

1.06 - LTL properties

2014-10-0811:46

1.05 - The reachability graph for SN analysis

2014-10-0812:31

1.04 - Modelling with Symmetric Nets

2014-10-0807:27

1.03 - Syntax and semantics of SN

2014-10-0822:50

1.02 - Introduction

2014-10-0814:58

1.01 - Opening

2014-10-0802:21

00:00

1.0x

1.05 - The reachability graph for SN analysis

#box-pro-ellipsis-175848615479876{-webkit-line-clamp:2;}1.05 - The reachability graph for SN analysis

1.05 - The reachability graph for SN analysis

Fabrice Kordon

1.05 - The reachability graph for SN analysis