Enforcing Periodic Transition Deadlines in Time Petri Nets With Net Unfoldings
暂无分享,去创建一个
Ugo Buy | Houshang Darabi | Liviu Grigore | Mihai Lehene | Haisheng Wang | H. Darabi | U. Buy | Haisheng Wang | L. Grigore | Mihai Lehene
[1] Samuel Corenstein. An Algorithm for Project (Job) Sequencing with Resource Constraints , 1972, Oper. Res..
[2] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[3] Bernardete Ribeiro,et al. Computational intelligence in manufacturing quality control , 2004 .
[4] Walter Vogler,et al. An Improvement of McMillan's Unfolding Algorithm , 2002, Formal Methods Syst. Des..
[5] Javier Esparza,et al. Unfoldings - A Partial-Order Approach to Model Checking , 2008, Monographs in Theoretical Computer Science. An EATCS Series.
[6] Ugo Buy,et al. Enforcing transition deadlines in time Petri nets , 2007, 2007 IEEE Conference on Emerging Technologies and Factory Automation (EFTA 2007).
[7] Xiaolan Xie,et al. Control of Safe Ordinary Petri Nets Using Unfolding , 2005, Discret. Event Dyn. Syst..
[8] Panos J. Antsaklis,et al. Feedback control of Petri nets based on place invariants , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.
[9] MengChu Zhou,et al. Deadlock control methods in automated manufacturing systems , 2004, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.
[10] A. Semenov,et al. Verification of asynchronous circuits using time Petri net unfolding , 1996, 33rd Design Automation Conference Proceedings, 1996.
[11] P. Merlin,et al. Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.
[12] Eugene Asarin,et al. Scheduling with timed automata , 2006, Theor. Comput. Sci..
[13] A. Kusiak,et al. Resource constrained scheduling of hierarchically structured design activity networks , 1995 .
[14] Michael D. Lemmon,et al. Liveness-enforcing supervision of bounded ordinary Petri nets using partial order methods , 2002, IEEE Trans. Autom. Control..
[15] Andrew Kusiak,et al. Decomposition in automatic generation of Petri nets for manufacturing system control and scheduling , 2000 .
[16] J. M. Tamarit,et al. Project scheduling with resource constraints: A branch and bound approach , 1987 .
[17] M. Diaz,et al. Modeling and Verification of Time Dependent Systems Using Time Petri Nets , 1991, IEEE Trans. Software Eng..
[18] Joseph Sifakis,et al. On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract) , 1995, STACS.
[19] J. Carlier,et al. An algorithm for solving the job-shop problem , 1989 .
[20] Victor Khomenko,et al. Model checking based on prefixes of petri net unfoldings , 2003 .
[21] MengChu Zhou,et al. Elementary siphons of Petri nets and their application to deadlock prevention in flexible manufacturing systems , 2004, IEEE Trans. Syst. Man Cybern. Part A.
[22] Kenneth L. McMillan,et al. A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..
[23] Mohsen A. Jafari. Petri net based shop floor controller and recovery analysis , 1990, Proceedings., IEEE International Conference on Robotics and Automation.
[24] Sol M. Shatz,et al. Application and experimental evaluation of state space reduction methods for deadlock analysis in Ada , 1994, TSEM.
[25] Mohsen A. Jafari,et al. Finite automata decomposition for flexible manufacturing systems control and scheduling , 2003, IEEE Trans. Syst. Man Cybern. Part C.