barkaoui3
Incidence matrix:
-1 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0
0 0 0 -1 1 0 0 -1 0 0 0 0 0 0 0 0 0 0
0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 -1 0 0 -1 1 0 0 0 0
0 0 0 0 0 0 0 0 1 0 0 -1 1 0 0 0 0 0
0 0 0 0 0 0 0 1 0 0 -1 1 0 0 0 0 0 0
0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0
0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 0 1 0
0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1
0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 -1
0 -1 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0
0 0 0 -1 1 0 0 -1 0 0 0 0 0 0 0 0 0 0
0 0 0 0 -1 1 0 0 -1 0 0 0 0 0 0 0 0 0
1 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 -1 0 0 -1 1 0 0 0 0
0 0 0 0 0 0 0 0 1 0 0 -1 1 0 0 0 0 0
0 0 0 0 0 0 0 1 0 0 -1 1 0 0 0 0 0 0
0 1 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0
0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 0 1 0
0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1
0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 -1
0 -1 0 0 0 0 -1 0 0 0 1 0 0 0 0 0 0 0
Note: columns represent places and rows represent transitions of the net.
Places: P0, P1, P2, P3, P4, P5, P6, P7, P8, P9, P10, P11, P12, P13, P14, P15, P16, P17
Transitions: T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12
Initial marking: [ 111000000000000000 ]
Transitions: T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12
Initial marking: [ 111000000000000000 ]
Benchmark: "barkaoui3"
Source: Verification in Concurrent Programming with Petri nets Structural Techniques
Source_www: http://cedric.cnam.fr/fichiers/RC416.pdf
Source_fig_name: Figure 3 page 7
Designed by: bartosz.z@hotmail.com
Type of benchmark:
Date of creation: 17.07.2016
Last modification: 28.07.2016
Converted via: XML2TAB (L.Stefanowicz@weit.uz.zgora.pl)
Bounded: TRUE
Source: Verification in Concurrent Programming with Petri nets Structural Techniques
Source_www: http://cedric.cnam.fr/fichiers/RC416.pdf
Source_fig_name: Figure 3 page 7
Designed by: bartosz.z@hotmail.com
Type of benchmark:
Date of creation: 17.07.2016
Last modification: 28.07.2016
Converted via: XML2TAB (L.Stefanowicz@weit.uz.zgora.pl)
Bounded: TRUE
Target:
Classification: Simple Net
Covered by p-invariants: TRUE
Live: TRUE
Safe: TRUE
Classification: Simple Net
Covered by p-invariants: TRUE
Live: TRUE
Safe: TRUE
More actions:
Decomposition (comparability graphs)
Decomposition (heuristic invariants)
Petri net cover (heuristic invariants)
Concurrency analysis (graph cliques)
Sequentiality analysis (graph cliques)
Please note:
- decomposition and analysis methods (except p-invariants) base on a structural concurrency relation,
- it may take a few minutes to open. Timeout = 5 minutes.