DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Un, Chong-Kwan | - |
dc.contributor.advisor | 은종관 | - |
dc.contributor.author | Kim, Yong-Jin | - |
dc.contributor.author | 김용진 | - |
dc.date.accessioned | 2011-12-14T02:13:27Z | - |
dc.date.available | 2011-12-14T02:13:27Z | - |
dc.date.issued | 1989 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=66871&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/39082 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전기 및 전자공학과, 1989.8, [ vi, 63 p. ] | - |
dc.description.abstract | In this thesis, an efficient protocol verification system named LOVE has been designed and implemented. LOVE has been developed specifically for LOTOS(language for temporal ordering specification) which has been developed as a Formal Description Technique by ISO(Internatinal Standard Organization) for the description of the OSI(Open System Interconnection) architecture. Protocol verification in LOVE is done in two steps, protocol syntax validation(PSV) and protocol functional verification(PFV). PSV is a test to check if a protocol is free from protocol syntax errors such as deadlocks, unspecified receptions, state ambiguities and livelocks. PFV confirms whether a protocol achieves its functional objectives. The reachability analysis is done for the PSV and the observational equivalence test is used for the PFV. LOVE, an abbreviation for LOtos VErifier, is the name given to a set of programs and command files which can be used for protocol simulation, PSV, and PFV. The input domain of the LOVE is a subset of LOTOS called the basic LOTOS. The basic LOTOS is an abridged version of the language employing a finite set of observable actions. The basic LOTOS deals with gate synchronization, but it does not check passing data values. LOVE has been installed on a SUN 3/280 machine running under the Unix operating system(OS), but it can be installed on any other Unix OS systems because it has no hardware-dependent codes. All programs have been written in C language. LOVE has two main parts, action tree builder(ATB) and equivalence tester(ET). The first main part, ATB, executes a basic LOTOS specification in batch mode, generates the corresponding action tree, and performs the PSV. Action tree is a kind of labelled transition diagram in which state information is contained implicitly. Because LOTOS is an event-based FDT, an action tree contains all dynamic characteristics of the LOTOS specification. The reachability analysis is performed on an action tree of the PSV. The ... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.title | Design and implementation of a protocol verification system - LOVE | - |
dc.title.alternative | 프로토콜 검증 시스템의 설계 및 구현 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 66871/325007 | - |
dc.description.department | 한국과학기술원 : 전기 및 전자공학과, | - |
dc.identifier.uid | 000841063 | - |
dc.contributor.localauthor | Un, Chong-Kwan | - |
dc.contributor.localauthor | 은종관 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.