COMP290084. Graphical Representation of Asynchronous Systems Jan 15, 2004. Graphical Representation. Petri Nets Asynchronous State Graphs BurstMode Representation Timed Automata. Petri Nets. Reference:
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
COMP290084
Graphical Representation of Asynchronous Systems
Jan 15, 2004
Reference:
Credits
Lecture Notes by:
Gabriel Eirea
UC Berkeley
Petri Nets: Properties, Analysis and Applications
Gabriel Eirea
UC Berkeley
10/8/02
Based on paper by T. Murata
2H2 + O2 2H2O
2
t
H2
2
H2O
O2
2H2 + O2 2H2O
2
t
H2
2
H2O
O2
vend 15¢ candy
10
15
5
5
5
5
0
5
10
10
20
10
vend 20¢ candy
vend 15¢ candy
10
5
state machines:
each transition
has exactly
one input and
one output
5
5
5
10
10
vend 20¢ candy
vend
10
5
conflict,
decision
or choice
5
5
5
10
10
vend
t2
marked graph:
each place has
exactly one
incoming arc
and one
outgoing
arc.
t1
t4
t3
concurrency
t2
t1
t4
t3
x = (a+b)/(ab)
a
copy
+
/
x
a+b
a
!=0
b
copy

ab
NaN
b
=0
ready
to send
ready
to receive
buffer
full
send
msg.
receive
msg.
wait
for ack.
proc.2
proc.1
msg.
received
receive
ack.
send
ack.
buffer
full
ack.
received
ack.
sent
k
k
writing
k
reading
k
M0=(100)
p1
t3
p2
t1
t0
t2
p3
M0=(100)
t1
p1
t3
M1=(001)
“dead end”
p2
t1
t0
t2
p3
M0=(100)
t1
t3
p1
t3
M1=(001)
“dead end”
M3=(10)
p2
t1
t0
t2
p3
M0=(100)
t1
t3
p1
t3
M1=(001)
“dead end”
M3=(10)
t1
p2
t1
t0
M4=(01)
t2
p3
M0=(100)
t1
t3
p1
t3
M1=(001)
“dead end”
M3=(10)
t1
t3
p2
t1
t0
M4=(01)
M3=(10)
“old”
t2
p3
M0=(100)
t1
t3
p1
t3
M1=(001)
“dead end”
M3=(10)
t1
t3
p2
t1
t0
M4=(01)
M6=(10)
“old”
t2
t2
p3
M5=(01)
“old”
M0=(100)
100
t1
t3
t1
t3
M1=(001)
“dead end”
M3=(10)
001
10
t1
t3
t1
t3
M4=(01)
M6=(10)
“old”
01
t2
t2
M5=(01)
“old”
coverability graph
coverability tree
PN
PN
AC
EFC
FC
SM
MG