Hippo / Petri nets

ConsistentExampleMessageView

Incidence matrix:

-1 1 0 1 0 0 0 0 0 0
0 -1 1 0 -1 1 1 0 0 0
0 0 0 -1 0 0 0 -1 1 0
0 0 0 0 1 0 0 0 -1 0
0 0 0 0 0 -1 0 0 1 0
0 0 0 0 0 0 0 0 -1 1

Note: columns represent places and rows represent transitions of the net.

Places: P1, P2, P3, P4, P5, P6, P7, P8, P9, P10
Transitions: t1, t2, t3, t4, t5, t6
Initial marking: [ 1000000100 ]

Benchmark: "06_exp ConsistentExampleMessageView"
Author: L.Stefanowicz (L.Stefanowicz@weit.uz.zgora.pl)
Type of benchmark: real
Date of creation: 09.06.2013
Last modification: 09.06.2013
Source: http://msdl.cs.mcgill.ca/people/hv/teaching/MS/COMP522B2008/projects/material/Wisam.AlAbed/06Experiments_html

Target: decomposition
Classification: Free Choice Net
Covered by p-invariants: TRUE
Live: FALSE
Safe: TRUE

More actions:

Petri net classification

Place invariant analysis

Decomposition (hypergraphs)

Decomposition (comparability graphs)

Decomposition (heuristic invariants)

Petri net cover (hypergraphs)

Petri net cover (heuristic invariants)

Concurrency analysis (graph cliques)

Sequentiality analysis (graph cliques)

Export to Verilog code

Export to PIPE XML format

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.