Abstrait

Siphon and Trap Analysis of Buffer of a Flexible Manufacturing System with Three Machines and Two Jobs Using Sign Incidence Matrix and its Digraphs

P. Balaji*, K. Rangarajan and M. Sathiyaraj

There is an algorithm, which finds the set of places, which are both siphon and trap. In this paper we used that algorithm to find the set of places, which are both siphon and trap. There are two methods exists to convert a Petri net in to a digraph. In the first method the transitions of the Petri nets are changed into places and the places of the Petri nets are changed in to edges. In the first method we change both the places and transition and places as vertices and the arcs between them as edges. We used both the methods and found two digraphs which are not Euler/Hamiltonian digraphs. Therefore further analysis is not possible.