Modeling and Race Detection of Ladder Diagrams via Ordinary Petri Nets

Document Type

Article

Publication Date

7-1-2018

Abstract

This paper presents an ordinary Petri net (PN)-based approach to the modeling and race-detection problems of programs for programmable logic controllers (PLCs). First, a PLC program is formalized by a graph where nodes represent contacts and coils. Second, an algorithm is proposed to translate this graph into an ordinary PN. Third, a method is presented to detect whether there exists a race in a program by using a reachability graph technique, to locate a race by introducing the race path, and to correct a race by analyzing the subnet that contains it. An example is utilized to illustrate the theoretic results.

Identifier

85048676286 (Scopus)

Publication Title

IEEE Transactions on Systems Man and Cybernetics Systems

External Full Text Location

https://doi.org/10.1109/TSMC.2016.2647219

e-ISSN

21682232

ISSN

21682216

First Page

1166

Last Page

1176

Issue

7

Volume

48

Grant

61573158

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS