Deadlock avoidance in the operating systems with using coloured Petri nets


Creative Commons License

Moharrami S., Karimov A.

International Journal of Soft Computing, vol.7, no.2, pp.38-43, 2012 (Scopus) identifier

  • Publication Type: Article / Article
  • Volume: 7 Issue: 2
  • Publication Date: 2012
  • Doi Number: 10.3923/ijscomp.2012.38.43
  • Journal Name: International Journal of Soft Computing
  • Journal Indexes: Scopus
  • Page Numbers: pp.38-43
  • Keywords: Coloured Petri Nets, Deadlock avoidance, Operating system, Place, Resources, Transition
  • Azerbaijan State University of Economics (UNEC) Affiliated: Yes

Abstract

Now a days with advances in computer science and increase in processor speed, modeling methods have found extensive applications in industrial fields. Coloured Petri Nets are one of these modeling methods. Coloured Petri Nets are based on graph theory and are applied specifically for concurrent and asynchronous applications. As executable models, they are capable of graphical description of complicated systems. On the other hand, development of hardware and other peripheral computer resources and development of various computer software systems call for efficient and powerful operating systems so that users can use the software and hardware items in an effective manner. The purpose of this research is to study the application of Coloured Petri Nets for modeling resource management in operating systems with the aim of optimal utilization of resources and Deadlock Avoidance in the operating systems. © Medwell Journals, 2012.