All
All

What are you looking for?

All
Projects
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Supervisory Control of ( max,+ ) Automata: Timing Aspects

Result description

An important class of both timed automata and weighted automata are the ( max,+ ) automata. They are used as a model of a class of timed discrete event systems and their supervisory control is developed. The concept of supervised product is introduced tocontrol ( max,+ ) automata and its properties are studied. Decomposition of morphism matrix of the controlled system based on the tensor dioid algebra is proposed and the supervisory control of ( max,+ )automata is studied using residuation theory of formal power series.

Keywords

timed discrete-event systems(max +) - automatadioid algebra

The result's identifiers

Alternative languages

  • Result language

    angličtina

  • Original language name

    Supervisory Control of ( max,+ ) Automata: Timing Aspects

  • Original language description

    An important class of both timed automata and weighted automata are the ( max,+ ) automata. They are used as a model of a class of timed discrete event systems and their supervisory control is developed. The concept of supervised product is introduced tocontrol ( max,+ ) automata and its properties are studied. Decomposition of morphism matrix of the controlled system based on the tensor dioid algebra is proposed and the supervisory control of ( max,+ )automata is studied using residuation theory of formal power series.

  • Czech name

    Supervizní řízení ( max,+ ) automatu: časové aspekty

  • Czech description

    Důležitou třídou, jak časovaných, tak vážených automatů,jsou ( max,+ ) automaty. Používáme je jako model třídy časovaných diskrétních událostních systémů a studujeme jejich supervizní řízení. Zavádíme na nich operaci supervizního součinu, jejichž vlastnosti studujeme a použijeme na řízení ( max,+ ) automatu. Odvodíme rozklad matice morfismu řízeného systému pomocí tenzorové algebry na idempotentních polokruzích, který použijeme na supervizní řízení ( max,+ ) automatu založené na teorii zobecněných inverzí.

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

Others

  • Publication year

    2007

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of European Control Conference ( ECC 2007 )

  • ISBN

    978-960-89028-5-5

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    4417-4424

  • Publisher name

    European Union Control Association

  • Place of publication

    Kos

  • Event location

    Kos

  • Event date

    Jul 2, 2007

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article

Basic information

Result type

D - Article in proceedings

D

CEP

BA - General mathematics

Year of implementation

2007