Modeling and analysis of extended petri nets for discrete event systems with general time constraints일반화된 시간제약을 가진 이산사건 시스템을 위한 확장된 페트리 네트의 모델링 및 분석

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 717
  • Download : 0
Discrete event systems, including automated manufacturing systems such as cluster tools for semiconductor manufacturing, microcircuits, and real-time embedded software systems, often have strict time window constraints between pairs of events. Such systems are often operated so that each component or module repeats a predetermined identical work cycle or sequence. Such cyclic operation has advantages of simplicity, predictability, and better optimization. To model and analyze such time constrained decision-free discrete event systems, Lee and Park [1] pro-posed an extended event graph called negative event graph that generalizes notions of places and tokens by introducing negative places and tokens with negative token holding times and negative token counts, respectively, to represent time window constraints. For such negative event graphs, they derived necessary and sufficient conditions based on circuits for which a feasible schedule exists. In this thesis, we further extend the negative places and tokens to model more general time constraints so that negative places and conventional positive places allow conventional positive tokens and negative tokens, respectively. We call such an extended framework a generalized negative event graph(GNEG). We also propose new improved enabling and firing rules that can explain dynamic state evolution of such extended net model. Under a more general setting than the one for the negative event graph, we prove that the liveness condition similar to that for the negative event graph also holds for the extended model. We also identify the similar feasible cycle time range and present an application to scheduling a cluster tool with intermediate buffers. Second, a timing control and implementation problem for decision-free discrete event systems with general time constraints is discussed. Even if a system turns out to be schedulable from the liveness condition of a GNEG, the conventional timing control method, which starts each...
Advisors
Lee, Tea-Eogresearcher이태억researcher
Description
한국과학기술원 : 산업공학과,
Publisher
한국과학기술원
Issue Date
2006
Identifier
254271/325007  / 020005223
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 산업공학과, 2006.2, [ viii, 101 p. ]

Keywords

schedulability; general time constraint; time window; event graph; Negative token; cycle time; 싸이클 타임; 스케줄 가능성; 이벤트 그래프; 일반화된 시간제약; 시간 범위; 네가티브 토큰

URI
http://hdl.handle.net/10203/40591
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=254271&flag=dissertation
Appears in Collection
IE-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