Using D-Elementary Hybrid Petri Nets and Linear Hybrid Automata for Modelling Manufacturing Systems

Abstract Hybrid Petri nets are known to be a powerful tool for modeling positive hybrid dynamic systems; and hybrid automata to have a great analysis power. Many authors have used these two models in a coupled manner to combine their advantages and translation algorithms from hybrid Petri nets to hybrid automata exist in the literature. Here we investigate a subclass of hybrid Petri nets called D-elementary hybrid Petri net. We present a structural algorithm allowing the translation of the D-elementary hybrid Petri nets out of linear hybrid automata. The resulting automaton has particular characteristics. The translation algorithm preserves the behavioral semantics; we prove hereafter the timed bisimilarity of the D-elementary hybrid Petri net and the linear hybrid automaton obtained by the translation algorithm. A manufacturing system will be used as an illustrative example.

[1]  Didier Lime,et al.  State class timed automaton of a time Petri net , 2003, 10th International Workshop on Petri Nets and Performance Models, 2003. Proceedings..

[2]  Goran Frehse,et al.  PHAVer: algorithmic verification of hybrid systems past HyTech , 2005, International Journal on Software Tools for Technology Transfer.

[3]  Thomas A. Henzinger,et al.  Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems , 1992, Hybrid Systems.

[4]  Olivier H. Roux,et al.  Structural Translation from Time Petri Nets to Timed Automata , 2005, Electron. Notes Theor. Comput. Sci..

[5]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[6]  M. Diaz,et al.  Modeling and Verification of Time Dependent Systems Using Time Petri Nets , 1991, IEEE Trans. Software Eng..

[7]  Hassane Alla,et al.  Combining hybrid Petri nets and hybrid automata , 2001, IEEE Trans. Robotics Autom..

[8]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.