Using of Finite Automation at Programming PLC
Karol Rastocny, Juraj Zdansky
DOI:
Abstract
The paper is concerning with systematic advances at programming programmable logic controllers (PLC), which comes out from algebraic description of behaviour of sequential circuit, in the way of finite automaton. This kind of access is streamlining the work of a programmer and enabling to use formalisms in the of whole process of system development, that is from process of analysing demands to process of verification and validation created program. The paper considers about using of ladder diagram at programming PLC.