Qualitative verification of finite and real-time DEVS networks
暂无分享,去创建一个
[1] Bernard P. Zeigler,et al. A Reachable Graph of Finite and Deterministic DEVS Networks , 2006 .
[2] Edmund M. Clarke,et al. Model Checking , 1999, Handbook of Automated Reasoning.
[3] Xiaolin Hu,et al. Model continuity in the design of dynamic distributed real-time systems , 2005, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.
[4] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[5] Bernard P. Zeigler,et al. Processing Time Bounds of Schedule-Preserving DEVS ⁄ , 2007 .
[6] Tag Gon Kim,et al. Application of Real-Time DEVS to Analysis of Safety-Critical Embedded Control Systems: Railroad Crossing Control Example , 2005, Simul..
[7] Gabriel A. Wainer,et al. Rational time-advance DEVS (RTA-DEVS) , 2010, SpringSim.
[8] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..
[9] Bernard P. Zeigler,et al. Theory of modeling and simulation , 1976 .
[10] Bernard P. Zeigler,et al. Reachability Graph of Finite & Deterministic DEVS Networks , 2007 .
[11] Kyu Ho Park,et al. A Real-Time Discrete Event System Specification Formalism for Seamless Real-Time Software Development , 1997, Discret. Event Dyn. Syst..
[12] Bernard P. Zeigler,et al. Reachability Graph of Finite and Deterministic DEVS Networks , 2009, IEEE Transactions on Automation Science and Engineering.
[13] Moon Ho Hwang. Generating finite-state global behavior of reconfigurable automation systems: DEVS approach , 2005, IEEE International Conference on Automation Science and Engineering, 2005..