Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2005 | 15 | 1 | 141-150
Tytuł artykułu

A novel continuous model to approximate time Petri nets: modelling and analysis

Treść / Zawartość
Warianty tytułu
Języki publikacji
In order to approximate discrete-event systems in which there exist considerable states and events, David and Alla define a continuous Petri net (CPN). So far, CPNs have been a useful tool not only for approximating discrete-event systems but also for modelling continuous processes. Due to different ways of calculating instantaneous firing speeds of transitions, various continuous Petri net models, such as the CCPN (constant speed CPN), VCPN (variable speed CPN) and the ACPN (asymptotic CPN), have been proposed, where the continuous flow is specified uniquely by maximal firing speeds. However, in applications such as chemical processes there exist situations where the continuous flow must be above some minimal speed or in the range of minimal and maximal speeds. In this paper, from the point of view of approximating a time Petri net, the CPN is augmented with maximal and minimal firing speeds, and a novel continuous model, i.e., the Interval speed CPN (ICPN) is defined. The enabling and firing semantics of transitions of the ICPN are discussed, and the facilitating of continuous transitions is classified into three levels: 0-level, 1-level and 2-level. Some policies to resolve the conflicts and algorithms to undertake the behavioural analysis for the ICPN are developed. In addition, a chemical process example is presented. sm
Opis fizyczny
  • School of Computer Science, Guilin University of Electronic Technology, Guilin 541004, China
  • School of Computer Science, Guilin University of Electronic Technology, Guilin 541004, China
  • Balduzzi F., Giua A. and Menga G. (2000): First-order hybrid Petri nets: A model for optimization and control. - IEEE Trans. Robot. Automat., Vol. 16, No. 4, pp. 382-398.
  • Bail Le J., Alla H. and David R.(1992): Asymptotic continuous Petri nets: An efficient approximation of discrete event systems. - Proc. IEEE Int. Conf. Robotics and Automation, Nice, France, pp. 1050-1056.
  • David R. and Alla H. (1987): Continuous Petri nets. - Proc. 8th Europ. Workshop Application and Theory of Petri Nets, Zaragoza, Spain,pp. 275-294.
  • David R. and Alla H. (2001): On hybrid Petri nets. - Discr. EventDynam. Syst. Theory Applic., Vol. 1, No. 1, pp. 9-40.
  • Dubois E., Alla H. and David R. (1994): Continuous Petri net with maximal speeds depending on time. - Proc. 5th Int. Conf. Application and Theory of Petri Nets, Zaragoza, Spain, pp. 32-39.
  • Gu T. and Bahri P.A. (2002): A survey of Petri-net applications in batch processes. - Comput. Ind., Vol. 47, No. 1, pp. 99-111.
  • Gu T., Bahri P.A. and Lee P.L. (2002): Development of hybrid time Petri nets for scheduling of mixed batch continuous process. - Proc. 15th IFAC World Congress, Barcelona, Spain, pp.1121-1126.
  • Merlin P.M. and Farber D.J. (1976): Recoverability of communication protocols-Implications of a theoretical study. - IEEE Trans. Commun., Vol. 24, No. 9, pp. 1036-1043.
  • Murata T. (1989): Petri nets: Properties, analysis and applications. - Proc. IEEE, Vol. 77, No. 1, pp. 541-580.
  • Ramchandani C. (1974): Analysis of asynchronous concurrent systems by timed Petri nets. - Massachusetts Inst. Technology, Techn. Rep., No. 120.
Typ dokumentu
Identyfikator YADDA
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.