| Summary: | 碩士 === 淡江大學 === 資訊工程學系 === 84 === At this high-developed computer technological age, each computer
developerall try their best to offer people a faster and more
convenient livingenvironment, so, the system grows bigger at
size and becomes more complicatedas well. In order to understand
system properties, people must use otheranalytic methods to
analyze systems. Petri net is an excellent system-analyzedtool.
In this thesis,we will discuss the reachability problem under
finite states,checking whether a system state still exists or
not. Reachability problem isalways a consequential point.
However, with the increasing size orcomplication of a system,
the state space will be very ponderous, and whichwill make
management difficult and inefficient.We use three steps to help
search the target state quickly. First, thenecessary condition
(P-invariants properties) is used to check the targetstate,
whether unreachable. Then, we use the sufficient condition of
[Tsuji andMurata 1993] to check the target state, whether
reachable. Finally, the enablesets of state are divided by
confusion or conflict relation, then each groupis selected out
one transition by heuristics method for firing concurrently
tospeed up the exhaustive search. Also, the "search & prune
method" is employeedto avoid repeated state.
|
|---|
