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”

Coordination control of discrete-event systems revisited

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F15%3A00443131" target="_blank" >RIV/67985840:_____/15:00443131 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/s10626-013-0179-x" target="_blank" >http://dx.doi.org/10.1007/s10626-013-0179-x</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s10626-013-0179-x" target="_blank" >10.1007/s10626-013-0179-x</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Coordination control of discrete-event systems revisited

  • Original language description

    In this paper, we revise and further investigate the coordination control approach proposed for supervisory control of distributed discrete-event systems with synchronous communication based on the Ramadge-Wonham automata framework. The notions of conditional decomposability, conditional controllability, and conditional closedness ensuring the existence of a solution are carefully revised and simplified. The approach is generalized to non-prefix-closed languages, that is, supremal conditionally controllable sublanguages of not necessary prefix-closed languages are discussed. Non-prefix-closed languages introduce the blocking issue into coordination control, hence a procedure to compute a coordinator for nonblockingness is included. The optimization problem concerning the size of a coordinator is under investigation. We prove that to find the minimal extension of the coordinator event set for which a given specification language is conditionally decomposable is NP-hard.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

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

    2015

  • 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

    Discrete Event Dynamic Systems-Theory and Applications

  • ISSN

    0924-6703

  • e-ISSN

  • Volume of the periodical

    25

  • Issue of the periodical within the volume

    1-2

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    30

  • Pages from-to

    65-94

  • UT code for WoS article

    000352212000005

  • EID of the result in the Scopus database

    2-s2.0-84926278189