Arithmetische Logik - Ein Brückenschlag zwischen diskreten Steuerungen und klassischen Regelungen (Q4367728)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1092881
Language Label Description Also known as
default for all languages
No label defined
    English
    Arithmetische Logik - Ein Brückenschlag zwischen diskreten Steuerungen und klassischen Regelungen
    scientific article; zbMATH DE number 1092881

      Statements

      Arithmetische Logik - Ein Brückenschlag zwischen diskreten Steuerungen und klassischen Regelungen (English)
      0 references
      0 references
      0 references
      14 January 1998
      0 references
      state space methods
      0 references
      discrete event systems
      0 references
      finite Boolean automaton
      0 references
      discrete time systems
      0 references
      strictly linear systems
      0 references
      This is the revised version of a plenary talk given at the 29th Colloquium on Control Theory (Boppard 1995). A novel approach to analysis and synthesis of discrete event systems is presented, oriented at the finite Boolean automaton as a mathematical model. By rewriting Boolean operations in an equivalent arithmetic notation well-known from reliability theory, the gap between discrete event systems and classical discrete time systems will be bridged in a methodical regard. The generally multilinear state equations of an automaton cover as an interesting special case strictly linear systems which are addressed in the main body of the paper. Based on some selected examples it will be shown how the well-established state space methods for discrete time systems can be adopted in a direct manner.
      0 references

      Identifiers