Distributed control system

Summary

A distributed control system (DCS) is a computerised control system for a process or plant usually with many control loops, in which autonomous controllers are distributed throughout the system, but there is no central operator supervisory control. This is in contrast to systems that use centralized controllers; either discrete controllers located at a central control room or within a central computer. The DCS concept increases reliability and reduces installation costs by localising control functions near the process plant, with remote monitoring and supervision. Distributed control systems first emerged in large, high value, safety critical process industries, and were attractive because the DCS manufacturer would supply both the local control level and central supervisory equipment as an integrated package, thus reducing design integration risk. Today the functionality of Supervisory control and data acquisition (SCADA) and DCS systems are very similar, but DCS tends to be used on

Official source

https://en.wikipedia.org/wiki/Distributed_control_system

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (7)

Related publications

Related people

Related units

Related concepts (11)

Related concepts

Related courses (6)

Related courses

Related lectures (12)

Related lectures

Related publications (7)

Application of Data Reconciliation to the Simulation of System Closure Options in a Paper Deinking Process

David Brown, Georges Heyen, François Maréchal

An equation solver data reconciliation software has been used to build a validated model of a waste paper deinking plant, by combining control rooms measurements and design specifications. An optimal sensor system configuration that allows validating key performance indicators by using only control room measurements has been determined by identifying, with genetic algorithm programming, the additional sampling points and corresponding sensors required for a minimum cost sensor system configuration.

2003

Formal verification of real-world software systems remains challenging for a number of reasons, including lack of automation, friction in specifying properties, and limited support for the diverse programming paradigms used in industry. In this thesis we make progress towards a better verification experience in general-purpose programming languages by contributing improvements both to the automated checking and the specification of safety properties in languages combining functional and imperative features. We present our extensions in two parts -- reasoning about shared mutable data, and types as specifications -- both of which ultimately rely on reductions of expressive surface languages to a functional core. Throughout, we instantiate our techniques for the particular example of Scala, a mixed-paradigm language widely-used in industry.The first part shows how to extend a verifier for higher-order functions and immutable data to support imperative programs with shared mutable data. We build upon Stainless, a contract-based verification system that relies on SMT solvers to automatically verify a large fragment of Scala. Our technique extends Stainless to check general heap-manipulating programs against modular specifications in the style of dynamic frames. A novelty of our approach is the translation of imperative function contracts that encodes frame conditions using quantifier-free formulas in first-order logic, instead of relying on quantifiers or on dedicated separation logic reasoning. Our quantifier-free encoding enables SMT solvers to both prove safety and to report counterexamples relative to the semantics of procedure contracts.In the second part we turn to types and type-level programming as an alternative means of specifying correctness properties. While dependent types have been studied extensively for purely-functional languages, we investigate their applications to languages with subtyping and (abstractions of) imperative features. We first study a calculus that provides type-level computation through singleton types and allows abstraction of state and IO through a non-deterministic choice operator. This allows for modelling interactions with existing imprecisely-typed and impure code. Our calculus is formalized and mechanically proven correct using the Coq proof assistant. In addition, we develop a prototypical implementation in the Scala compiler and study typical type-level programming use cases in the Scala ecosystem.

EPFL2022

Data reconciliation and sampling protocol design, case of a paper deinking process

David Brown, Georges Heyen, François Maréchal

An equation solver data reconciliation software has been used to build a validated model of a waste paper deinking mill, by combining control room measurements and process design specifications. An optimal sampling protocol to validate the model by using only control room measurements has been determined by identifying, with genetic algorithm programming, the additional sampling points and corresponding sensors required to compensate for the lack of refundant measurements.

2004

EPFL2022