automation3
Incidence matrix:
-1 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0
1 -1 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0
0 0 -1 1 0 0 0 0 0 0 0 -1 0 0 0 0 0
0 0 1 -1 0 0 0 0 0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 -1 -1 1 0 0 0 0 0 0 0 0
0 0 0 0 -1 0 0 1 0 0 0 0 -1 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 1 1 0 0 -1 0 0 0 0 0 1 0 1
0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0
0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0
0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0
0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 -1 0
0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1
1 -1 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0
0 0 -1 1 0 0 0 0 0 0 0 -1 0 0 0 0 0
0 0 1 -1 0 0 0 0 0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 -1 -1 1 0 0 0 0 0 0 0 0
0 0 0 0 -1 0 0 1 0 0 0 0 -1 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 1 1 0 0 -1 0 0 0 0 0 1 0 1
0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0
0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0 0
0 0 0 0 0 0 0 0 0 0 1 0 0 0 -1 0 0
0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 -1 0
0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 -1
Note: columns represent places and rows represent transitions of the net.
Places: P2, P1, P9, P8, P7, P5, P3, P4, P6, ac.T1.T3.delivered, ac.T6.T2.delivered, ac.T6.T8.delivered, ac.T7.T4.delivered, ac.T1.T3.received, ac.T6.T2.received, ac.T7.T4.received, ac.T6.T8.received
Transitions: T1, T2, T8, T7, T5, T4, T3, T6, ac.T1.T3.consume, ac.T6.T2.consume, ac.T7.T4.consume, ac.T6.T8.consume, ac.T1.T3.deliver, ac.T6.T2.deliver, ac.T7.T4.deliver, ac.T6.T8.deliver
Initial marking: [ 10011100000000000 ]
Transitions: T1, T2, T8, T7, T5, T4, T3, T6, ac.T1.T3.consume, ac.T6.T2.consume, ac.T7.T4.consume, ac.T6.T8.consume, ac.T1.T3.deliver, ac.T6.T2.deliver, ac.T7.T4.deliver, ac.T6.T8.deliver
Initial marking: [ 10011100000000000 ]
Benchmark: automation3
Author: University of Lisboa
Date of creation: Mon Jun 24 03:22:43 2013
Last modification: 03.07.2019
Modified by: Marcin Wojnakowski
Converted via: pnml2pnh (daniel.m.kur@gmail.com)
Bounded: TRUE
Author: University of Lisboa
Date of creation: Mon Jun 24 03:22:43 2013
Last modification: 03.07.2019
Modified by: Marcin Wojnakowski
Converted via: pnml2pnh (daniel.m.kur@gmail.com)
Bounded: TRUE
Classification: Simple Net
Covered by p-invariants: FALSE
Live: FALSE
Safe: TRUE
Covered by p-invariants: FALSE
Live: FALSE
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.