Incidence matrix:
1 0 0 0 0 0 0 0 0 -1 0
-1 1 0 0 0 0 -1 0 0 0 0
0 0 0 1 0 0 0 0 0 -1 0
0 0 0 -1 1 0 -1 0 0 0 0
0 0 0 0 0 -1 0 0 0 1 0
0 0 -1 0 0 0 0 0 0 1 0
0 -1 0 -1 1 0 0 -1 1 0 0
0 -1 1 0 0 0 1 0 0 0 0
0 0 0 0 -1 1 1 -1 0 0 1
0 1 0 0 -1 1 0 0 -1 0 0
0 0 0 0 0 0 0 1 0 0 -1
Note: columns represent places and rows represent transitions of the net.
Places: P0, P1, P2, P3, P4, P5, P6, P7, P8, P9, P7'
Transitions: T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10
Initial marking: [ 00000011010 ]
Benchmark: "bause1"
Source: Queueing Petri Nets A Formalism for the Combined Qualitative and Quantitative Analysis of Systems
Source_www: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.45.3210&rep=rep1&type=pdf
Source_fig_name: Figure 1 page 2
Designed by: bartosz.z@hotmail.com
Type of benchmark:
Date of creation: 03.04.2016
Last modification: 12.01.2018
Modified by: lukaszstohnij3@gmail.com
Converted via: XML2TAB (L.Stefanowicz@weit.uz.zgora.pl)
Bounded: TRUE
Covered by SMCs: FALSE
Target:
Classification: Petri Net
Covered by p-invariants: FALSE
Live: TRUE