Dept. of Comput. Sci. & Inf. Eng., National Taiwan Univ.Huang, Ya-HauYa-HauHuangLI-CHEN FU2007-04-192018-07-052007-04-192018-07-051998-0510504729http://ntur.lib.ntu.edu.tw//handle/246246/2007041910021818https://www.scopus.com/inward/record.uri?eid=2-s2.0-0031631394&doi=10.1109%2fROBOT.1998.677429&partnerID=40&md5=a8f6a4870fa61def5d2bd279acd04738A hybrid model of a multiple elevator system is proposed, consisting of a timed place Petri net (TPPN) model and a set of control rules implemented via the so-called control places in the TPPN model. The Petri net model is a highly modulized structure, whose constituent modules can be classified into four types: basic movement module, loading/unloading module, direction reversing module, and call management module. The whole complete model is a combination of the copies of the above four modules. Since the firing sequences of the TPPN equate the evolution of the modeled system, they can be regarded as a schedule. A dynamic scheduling strategy is proposed to obtain the desirable schedule. A new concept of control places is also introduced in the proposed model so as to make the modeling more precise and to reduce the reachability graph more efficiently. To show the feasibility of the proposed method, an emulator of the elevator system is constructed for demonstration. © 1998 IEEE.application/pdf537576 bytesapplication/pdfen-USPetri nets; Robotics; Scheduling; Elevators; Mathematical models; Petri nets; Basic movements; Call management; Dynamic scheduling; Elevator systems; Firing sequences; Hybrid Petri net; Petri net models; Reachability graphs; Elevators; SCADA systems; Timed place Petri net (TPPN) modelDynamic scheduling of elevator systems over hybrid Petri net/rule modelingconference paper10.1109/ROBOT.1998.6774292-s2.0-0031631394http://ntur.lib.ntu.edu.tw/bitstream/246246/2007041910021818/1/00677429.pdf