Iterative Specification Refinement in Deriving Logic Controllers
نویسندگان
چکیده
In this paper the refinement procedure of informal requirements in the context of an earlier proposed systematic procedure for logic controller design as sequential function chart (SFC) is described in detail. The use of two data formats is proposed: dependency charts (DC) and function tables (FT) that support hierarchy and modularization and are refined iteratively until a final degree of detail is reached from which the logic controller as SFC can be generated algorithmically.
منابع مشابه
A rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملCalculating modules in contextual logic program refinement
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specifications and code, and a refinement relation that models the notion of correct implementation. In this paper we extend and generalise earlier work on contextual refinement. Contextual refinement simplifies the refinement p...
متن کاملDisproving Using the Inverse Method by Iterative Refinement of Finite Approximations
In first-order logic, forward search using a complete strategy such as the inverse method can get stuck deriving larger and larger consequence sets when the goal query is unprovable. This is the case even in trivial theories where backward search strategies such as tableaux methods will fail finitely. We propose a general mechanism for bounding the consequence sets by means of finite approximat...
متن کاملSymbolic Models for Networked Control Systems
Networked control systems (NCS) are spatially-distributed systems in which communication between sensors, controllers, and actuators is supported by a shared communication network that is subject to variable communication delays, quantization errors, packet losses, limited bandwidth, and other practical non-idealities. This work investigates the problem of constructively deriving symbolic model...
متن کاملCounterexample-Guided Abstraction Refinement for PLCs
This paper presents a method for model checking programs for programmable logic controllers (PLCs) using the counterexample-guided abstraction refinement (CEGAR) approach. The technique is tailored to this specific hardware platform by accounting for the cyclic scanning mode that is symptomatic to PLCs. In particular, the hardware model poses the need for on-the-fly abstraction refinement in or...
متن کامل