| Summary: | 碩士 === 國立交通大學 === 資訊工程研究所 === 83 === It is more difficult to develop distributed programs than
sequential ones for many programmers. Nowadays, debugging tools
which exploiting the debugging method of sequential programs
are numerous. However, most debugging methods of distributed
programs focus on research of theory, not on debugging
software. In this thesis, we intend to supply a distributed
debugging method to help users to debug. In this thesis, we
want to solve a problem domain is LS1*LS2*...*LSn* CS12*...*
CS21...*CSn-1,n*CSn,n-1 != K, where LSi presents process Pi's
local state、CSi,j presents Pi to Pj channel's state、K is a
constant and * must satisfy the operator of associative and
eliminative laws, e.g. the addition operator +、the multiplate
operator *,etc. The time complexity of this debugging method is
only O(m), m is the total number of messages which deliver
between processes.
|
|---|
