A summary of some discrete-event system control problems

  • Authors:
  • Karen Rudie

  • Affiliations:
  • Department of Electrical and Computer Engineering, Queen's University, Kingston, Ontario, Canada

  • Venue:
  • CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

A summary of the area of control of discrete-event systems is given. In this research area, automata and formal language theory is used as a tool to model physical problems that arise in technological and industrial systems. The key ingredients to discrete-event control problems are a process that can be modeled by an automaton, events in that process that cannot be disabled or prevented from occurring, and a controlling agent that manipulates the events that can be disabled to guarantee that the process under control either generates all the strings in some prescribed language or as many strings as possible in some prescribed language. When multiple controlling agents act on a process, decentralized control problems arise. In decentralized discrete-event systems, it is presumed that the agents effecting control cannot each see all event occurrences. Partial observation leads to some problems that cannot be solved in polynomial time and some others that are not even decidable.