Modeling and Race Detection of Ladder Diagrams via Ordinary Petri Nets

Jiliang Luo; Qi Zhang; Xuekun Chen; Mengchu Zhou

doi:10.1109/TSMC.2016.2647219

Modeling and Race Detection of Ladder Diagrams via Ordinary Petri Nets

Jiliang Luo, Qi Zhang, Xuekun Chen, Mengchu Zhou

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

24 Scopus citations

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.

Original language	English (US)
Pages (from-to)	1166-1176
Number of pages	11
Journal	IEEE Transactions on Systems, Man, and Cybernetics: Systems
Volume	48
Issue number	7
DOIs	https://doi.org/10.1109/TSMC.2016.2647219
State	Published - Jul 2018

All Science Journal Classification (ASJC) codes

Software
Control and Systems Engineering
Human-Computer Interaction
Computer Science Applications
Electrical and Electronic Engineering

Keywords

Discrete event systems
IEC61131-3 standard
Petri nets (PNs)
formal methods
industrial automation
ladder diagram (LD)
race detection
supervisory control

Access to Document

10.1109/TSMC.2016.2647219

Cite this

@article{06c3d6d6d15d4da6be8cf2c990e6f887,

title = "Modeling and Race Detection of Ladder Diagrams via Ordinary Petri Nets",

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.",

keywords = "Discrete event systems, IEC61131-3 standard, Petri nets (PNs), formal methods, industrial automation, ladder diagram (LD), race detection, supervisory control",

author = "Jiliang Luo and Qi Zhang and Xuekun Chen and Mengchu Zhou",

note = "Publisher Copyright: {\textcopyright} 2013 IEEE.",

year = "2018",

month = jul,

doi = "10.1109/TSMC.2016.2647219",

language = "English (US)",

volume = "48",

pages = "1166--1176",

journal = "IEEE Transactions on Systems, Man, and Cybernetics: Systems",

issn = "2168-2216",

publisher = "IEEE Advancing Technology for Humanity",

number = "7",

}

TY - JOUR

T1 - Modeling and Race Detection of Ladder Diagrams via Ordinary Petri Nets

AU - Luo, Jiliang

AU - Zhang, Qi

AU - Chen, Xuekun

AU - Zhou, Mengchu

PY - 2018/7

Y1 - 2018/7

N2 - 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.

AB - 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.

KW - Discrete event systems

KW - IEC61131-3 standard

KW - Petri nets (PNs)

KW - formal methods

KW - industrial automation

KW - ladder diagram (LD)

KW - race detection

KW - supervisory control

UR - http://www.scopus.com/inward/record.url?scp=85048676286&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85048676286&partnerID=8YFLogxK

U2 - 10.1109/TSMC.2016.2647219

DO - 10.1109/TSMC.2016.2647219

M3 - Article

AN - SCOPUS:85048676286

SN - 2168-2216

VL - 48

SP - 1166

EP - 1176

JO - IEEE Transactions on Systems, Man, and Cybernetics: Systems

JF - IEEE Transactions on Systems, Man, and Cybernetics: Systems

IS - 7

ER -

Modeling and Race Detection of Ladder Diagrams via Ordinary Petri Nets

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this