Number of the records: 1  

Deciding detectability for labeled Petri nets

  1. 1.
    SYSNO0504048
    TitleDeciding detectability for labeled Petri nets
    Author(s) Masopust, Tomáš (MU-W) RID, ORCID, SAI
    Yin, X. (CN)
    Corespondence/seniorYin, X. - Korespondující autor
    Source Title Automatica. Roč. 104, June (2019), s. 238-241. - : Elsevier
    Document TypeČlánek v odborném periodiku
    Grant GC19-06175J GA ČR - Czech Science Foundation (CSF), CZ - Czech Republic
    Institutional supportMU-W - RVO:67985840
    Languageeng
    CountryNL
    Keywords discrete event systems * Petri nets * complexity
    Cooperating institutions Shanghai Jiao Tong University (China)
    URLhttp://dx.doi.org/10.1016/j.automatica.2019.02.058
    Permanent Linkhttp://hdl.handle.net/11104/0295763
    FileDownloadSizeCommentaryVersionAccess
    Masopust3.pdf9333.9 KBPublisher’s postprintrequire
     
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.