All

What are you looking for?

All
Projects
Results
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”

Hierarchical supervisory control under partial observation: Normality

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F23%3A00579254" target="_blank" >RIV/67985840:_____/23:00579254 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989592:15310/23:73620790

  • Result on the web

    <a href="https://doi.org/10.1109/TAC.2023.3257232" target="_blank" >https://doi.org/10.1109/TAC.2023.3257232</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/TAC.2023.3257232" target="_blank" >10.1109/TAC.2023.3257232</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Hierarchical supervisory control under partial observation: Normality

  • Original language description

    Conditions preserving observability of specifications between the plant and its abstraction are essential for hierarchical supervisory control of discrete-event systems under partial observation. Observation consistency and local observation consistency were identified as such conditions. To preserve normality, only observation consistency is required. Although observation consistency preserves normality between the levels for normal specifications, for specifications that are not normal, observation consistency is insufficient to guarantee that the supremal normal sublanguage computed on the low level and on the high level coincide. We define modified observation consistency, under which the supremal normal sublanguages of different levels coincide. We show that the verification of (modified) observation consistency is -hard for finite automata and undecidable for slightly more expressive models than finite automata. Decidability of (modified) observation consistency is an open problem. Hence we further discuss two stronger conditions that are easy to verify. Finally, we illustrate the conditions on an example of a railroad controller and on a case study of a part of an MRI scanner.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    20205 - Automation and control systems

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2023

  • 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

  • Name of the periodical

    IEEE Transactions on Automatic Control

  • ISSN

    0018-9286

  • e-ISSN

    1558-2523

  • Volume of the periodical

    68

  • Issue of the periodical within the volume

    12

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    13

  • Pages from-to

    7286-7298

  • UT code for WoS article

    001122871700098

  • EID of the result in the Scopus database

    2-s2.0-85151331378