Composition-based verification methodology for discrete event systems모델 복합법을 이용한 이산사건 시스템의 검증방법론

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 356
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorKim, Tag-Gon-
dc.contributor.advisor김탁곤-
dc.contributor.authorLee, Wan-Bok-
dc.contributor.author이완복-
dc.date.accessioned2011-12-14-
dc.date.available2011-12-14-
dc.date.issued2004-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=237650&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/35220-
dc.description학위논문(박사) - 한국과학기술원 : 전기및전자공학전공, 2004.2, [ ix, 106 p. ]-
dc.description.abstractSystems design has been an iterative process which involves several steps such as modelling, logical analysis, performance evaluation and implementation. If each step requires different model, it would be a major hurdle to a seamless design process. Therefore a unified modelling framework which provides a basis to specify models at different steps in common semantics is desirable. In this thesis we propose a new composition-based verification methodology for the DEVS (Discrete EVent Systems specification) models. The suggested composition-based technique is applicable not only to the formal verification area but also to the area of simulation-based verification. Therefore it provides an axis of a unified framework based on the DEVS formalism. For the formal verification of discrete event systems we defined the CDEVS (Communicating Discrete Event Systems) formalism which is an extended version of the DEVS formalism providing the nondeterministic representation of a system. As a means of a systematic proof technique, two operations, namly composition and minimization, are defined. These operations are compatible with the meaning of the communication semantics of the DEVS models, thus they incorporate the feature of spontaneity of output events in an 10 (Input/Output) system. In our methodology, an implementation model is reduced to an observational equivalent model through a series of stepwise compositions and minimizations. This incremental approach alleviates the state explosion problem in a verification process. Once a final operational CDEVS model is obtained, it can be verified either by an equivalence checking algorithm or by a valid implementation relationship which investigates both the functional correctness and the timeliness property. The proposed approach is much promising when analyzing large systems. If a component should be changed due to a design error, the overall composed model can be rebuilt by just composing the changed model with the unchange...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectDISCRETE EVENT SYSTEMS-
dc.subjectDEVS-
dc.subjectVERIFICATION METHODOLOGY-
dc.subjectSIMULATION SPEEDUP-
dc.subject시뮬레이션 속도 개선-
dc.subject모델 복합법-
dc.subject이산사건 시스템-
dc.subject검증방법론-
dc.titleComposition-based verification methodology for discrete event systems-
dc.title.alternative모델 복합법을 이용한 이산사건 시스템의 검증방법론-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN237650/325007 -
dc.description.department한국과학기술원 : 전기및전자공학전공, -
dc.identifier.uid000955282-
dc.contributor.localauthorKim, Tag-Gon-
dc.contributor.localauthor김탁곤-
Appears in Collection
EE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0