Petrukhina Elizaveta

MDI-192

VARIANT 13
 Step 1 (1 point)
Visualize the table as a Mealy Finite-State machine
diagram
S1 S2 S3 X2 Y1 X1 Y1
X1 Y2
X1 S2 S2 S1 S1 S2
X2 S1 S3 S3 Y1 X2
S1 S2 S3
X1 Y2 Y1 Y1 X2 Y1
X2 Y1 Y2 Y1 S3
X1 Y2
 Step 1 (1 point) Step 1 (1 point)
Divide this diagram into 3 parts

X2 Y1 X1 Y1 X2 Y1
X1 Y2 X1 Y2
S1 S2 S1 S2
Y1 X2
X1 Y1
X2 Y2
S2 S3
X2 Y1

S3
X1 Y2 X2 Y1
Y1 X1
S1 S3
 Step 2 (3 points)
Transform every part of the Mealy Finite-State machine
diagram to Petri Net diagram

X2 t1 Y1

X2 Y1
X1 Y2
S1 S2 S1

S2

X1 Y2

t2
 Step 2 (3 points)
Transform every part of the Mealy Finite-State machine
diagram to Petri Net diagram

X1 Y1
t3

X1 Y1 S2
X2 Y2
S2 S3 S3

X2 Y2

t4
 Step 2 (3 points)
Transform every part of the Mealy Finite-State machine
diagram to Petri Net diagram

X2 t5 Y1

S1
X2 Y1
S3
Y1 X1
S1 S3

t6
X1
 Step 3 (2 points)
Identify initial marking (as a vector) using the information
about the sequence and initial state

Marking pattern μ ( x1 x2 y1 y2 s1 s2 s3 )
SEQUENCE –X1X2X2X2X1X2X1
INITIAL STATE - S1

INITIAL MARKING μ0 (3 4 0 0 1 0 0)
 Step 3 (2 points)
Build the Configuration matrix – C of a Petri Net from step 2.

X1 t1 Y2

x1 x2 y1 y2 s1 s2 s3
t1 -1 0 0 1 -1 1 0
S1
t2 0 -1 1 0 0 0 0
S2
C= t3
t4
X2 Y1 t5
t2 t6
 Step 3 (2 points)
Build the Configuration matrix – C of a Petri Net from step 2.

X1 Y1
t3

x1 x2 y1 y2 s1 s2 s3
t1 -1 0 0 1 -1 1 0
S2
t2 0 -1 1 0 0 0 0
S3
C= t3 -1 0 1 0 0 0 0
t4 0 -1 0 1 0 -1 1
X2 Y2
t5
t4 t6
 Step 3 (2 points)
Build the Configuration matrix – C of a Petri Net from step 2.
X2 t5 Y1

S1
x1 x2 y1 y2 s1 s2 s3
S3
t1 -1 0 0 1 -1 1 0
t2 0 -1 1 0 0 0 0
C=
t6
t3 -1 0 1 0 0 0 0
t4 0 -1 0 1 0 -1 1
Y1
t5 0 -1 1 0 0 0 0
X1 t6 -1 0 1 0 1 0 -1
 Step 4 (2 points)
From Initial marking try to define whether it is possible to
reach the marking (0011010) using Matrix method

µk = µ0 + t·C
(0 0 1 1 0 1 0) =
-1 0 0 1 -1 1 0
0 -1 1 0 0 0 0
(3 4 0 0 1 0 0)+ -1 0 1 0 0 0 0
( X1 X2 X3 X4 X5 X6)* 0 -1 0 1 0 -1 1
0 -1 1 0 0 0 0
-1 0 1 0 1 0 -1
 Step 4 (2 points)
From Initial marking try to define whether it is possible to
reach the marking (0011010) using Matrix method

(-3 -4 1 1 -1 1 0) =
-1 0 0 1 -1 1 0
0 -1 1 0 0 0 0
( X1 X2 X3 X4 X5 X6)* -1 0 1 0 0 0 0
0 -1 0 1 0 -1 1
0 -1 1 0 0 0 0
-1 0 1 0 1 0 -1
 Step 4 (2 points)
From Initial marking try to define whether it is possible to
reach the marking (0011010) using Matrix method

(-3 -4 1 1 -1 1 0) = ( - x1 - x3 - x6, - x2 - x4 - x5, x2 + x3 + x5

+ x6, x1 + x4, x6 - x1, x1 - x4, x4 - x6)

-x1-x3-x6=-3 An inhomogeneous system of

-x2-x4-x5=-4 linear equations has no solution
(incompatible) since at the
x2 + x3 + x5 + x6 =1 intersection of row b and
x1+x4=1 column 7 is a non-zero number
-5, while the remaining
x6-x1=-1 numbers of this row are zero.
x1-x4=1 So it is impossible to reach the
x4-x6=0 marking (0011010).
 Step 5 (2 points)
Build the Petri Net reachability tree, name the vertices
(terminal, duplicate)
μ0 (3 4 0 0 1 0 0)

T1 t2

t2 t3

terminal