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”

Deciding detectability for labeled Petri nets

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F19%3A00504048" target="_blank" >RIV/67985840:_____/19:00504048 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989592:15310/19:73595710

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.automatica.2019.02.058" target="_blank" >http://dx.doi.org/10.1016/j.automatica.2019.02.058</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.automatica.2019.02.058" target="_blank" >10.1016/j.automatica.2019.02.058</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Deciding detectability for labeled Petri nets

  • Original language description

    Detectability of discrete event systems is a property to decide whether the current and subsequent states can be determined based on observations. We investigate the existence of algorithms for checking strong and weak detectability for systems modeled as labeled Petri nets. Strong detectability requires that we can always determine, after a finite number of observations, the current and subsequent markings of the system, while weak detectability requires that we can determine, after a finite number of observations, the current and subsequent markings for some trajectories of the system. We show that there is an algorithm to check strong detectability requiring exponential space, and that there is no algorithm to check weak detectability.

  • 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

    <a href="/en/project/GC19-06175J" target="_blank" >GC19-06175J: Compositional Methods for the Control of Concurrent Timed Discrete-Event Systems</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2019

  • 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

    Automatica

  • ISSN

    0005-1098

  • e-ISSN

  • Volume of the periodical

    104

  • Issue of the periodical within the volume

    June

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    4

  • Pages from-to

    238-241

  • UT code for WoS article

    000466616600027

  • EID of the result in the Scopus database

    2-s2.0-85063045219