Worst-case timing prediction of relay ladder logic by constraint analysis

Seoul, Korea October 30-November 01

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/RTCSA.1996.554975

Third International Workshop on Real- ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Kyeonghoon Koo Articles by Wook Hyun Kwon

	ASCII Text	x
	Kyeonghoon Koo, Wook Hyun Kwon, "Worst-case timing prediction of relay ladder logic by constraint analysis," Real-Time Computing Systems and Applications, International Workshop on, pp. 180, Third International Workshop on Real-Time Computing Systems Application (RTCSA'96), 1996.

	BibTex	x
	@article{ 10.1109/RTCSA.1996.554975, author = {Kyeonghoon Koo and Wook Hyun Kwon}, title = {Worst-case timing prediction of relay ladder logic by constraint analysis}, journal ={Real-Time Computing Systems and Applications, International Workshop on}, volume = {0}, year = {1996}, isbn = {0-8186-7626-4}, pages = {180}, doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.1996.554975}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Real-Time Computing Systems and Applications, International Workshop on TI - Worst-case timing prediction of relay ladder logic by constraint analysis SN - 0-8186-7626-4 SP EP A1 - Kyeonghoon Koo, A1 - Wook Hyun Kwon, PY - 1996 KW - logic programming; worst-case timing prediction; relay ladder logic; constraint analysis; application programs; boolean logic equations; complexity; logic programming; logic equations VL - 0 JA - Real-Time Computing Systems and Applications, International Workshop on ER -

Kyeonghoon Koo, Sch. of Electr. Eng., Seoul Nat. Univ., South Korea

Wook Hyun Kwon, Sch. of Electr. Eng., Seoul Nat. Univ., South Korea

In this paper, we propose a technique of predicting the execution time of PLC application programs written in relay ladder logic. The proposed technique divides an RLL program into several RLL blocks and then transforms them into boolean logic equations. The internal states of an RLL program is analyzed and their dependencies are used as constraints when we solve the boolean logic equations. The plant information represented by exclusiveness of input contacts is also used as constraints. The constraint analysis reduces the complexity of logic programming as well as the worst-case timing prediction. The algorithm for partitioning variables in the logic equations is developed to reduce the complexity further.

Index Terms:

logic programming; worst-case timing prediction; relay ladder logic; constraint analysis; application programs; boolean logic equations; complexity; logic programming; logic equations

Citation:

Kyeonghoon Koo, Wook Hyun Kwon, "Worst-case timing prediction of relay ladder logic by constraint analysis," rtcsa, pp.180, Third International Workshop on Real-Time Computing Systems Application (RTCSA'96), 1996

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.