Biology Reference
In-Depth Information
In the above algorithm, the main routine
Eq-Produce
(
PN
) is designed to find all the synchronous
transitions for delay time determination. In
Step 1
◦
, synchronous transitions are sequentially saved to
the list
LT
from the source transitions to the sink transitions. The sets of synchronous and sink transitions
are initialized in
2
◦
and
3
◦
, respectively. In
5
◦
, the sub-routine
dfs-push
(
t
,
stack
,
PN
) is executed, in
which first argument
t
is a transition pulled from the head of list
LT
in
4
◦
.In
6
◦
, the function
EQ1
(
t
sync
)
outputs conditional expression regarding
t
sync
by using Eq. (6). The procedures in
4
◦
-
8
◦
are executed
until
LT
is empty. That is, if all the synchronous transitions stored in
LT
are searched, the algorithm will
stop.
The sub-routine
dfs-push
(
t
,
stack
,
PN
) is a function recursively carrying out an operation of Depth
First Search from selected transition
t
(given as the first argument in the main function) towards the
source transitions. In
2
◦
, a judgment procedure if the input place
p
of
t
is in a conflict place or not, is
