The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Major part of discrete industrial automation hardware is controlled by Programmable Logic Controllers (PLCs). While Petri-nets (PNs) have been proposed by many researchers for modelling shop floor discrete control, the majority of the world PLCs are programmed using ladder diagrams (LD) and significant portion of them cannot be programmed using another language. This paper proposes hierarchical approach to translating PN to LD: for describing the high level process, it introduces automatic translation technique of process level PN, while utilizing a recently developed method (for translating PN to Boolean logic) for translating the embedded tasks to a LD. Interestingly, the generated LD code enables the reconstruction of the original Petri-net...
This paper illustrate through a case study the advantages of the proposed Transition Network (TN) for modelling discrete automation on the shop floor. TN is associated with high-level state diagram The proposed technique can easily simulate and emulate the automation logic and can be automatically translated to PLC (Programmable Logic Controller) code.
A translational sweep is the translating of a polygon, called the generatrix G, around another polygon, called the directrix D, under two conditions: (1) G is always in contact with D; and (2) the interiors of G and D do not intersect. Three classes of translational sweep are studied, including the case in which both G and D are convex; the case in which G is convex, D monotone; and the case in which...
A set of spanning line segments ? in a polyhedron P preserves the property of intersection; that is, a plane intersects P if and only if it also intersects ?. This paper gives a linear time algorithm for constructing ? for a polyhedron with N extreme vertices. If N is odd, the algorithm is optimal in yielding N/2+1 spanning line segments. If N is even, it gives (N/2)+1, which is optimal in some cases...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.