@article{LAI2021109490,
    Abstract = {In this paper, we investigate the verification problem of initial-state detectability (I-detectability) and initial-state opacity (I-opacity) in discrete event systems modeled by unambiguous weighted automata. An I-observer is constructed so as to derive necessary and sufficient conditions for checking strong I-detectability, weak I-detectability, and I-opacity, with exponential complexity. In addition, an approach based on diagnosability analysis is proposed for verifying strong I-detectability. Compared with an I-observer-based approach, the diagnosability-based approach has a lower complexity, and in the case where all the unobservable events in an unambiguous weighted automaton are represented by a unique symbol, the diagnosability-based approach has polynomial complexity.},
    Author = {Lai, Aiwen and Lahaye, S{\'e}bastien and Li, Zhiwu},
    File = {Initial-state detectability and initial-state opacity of unambiguous weighted automata - 1-s2.0-S0005109821000108-main - t.pdf},
    ISSN = {0005-1098},
    Journal = {Automatica},
    Keywords = {Weighted automaton, Initial state estimation, Initial-state detectability, Initial-state opacity},
    Pages = {109490},
    Title = {Initial-state detectability and initial-state opacity of unambiguous weighted automata},
    URL = {https://www.sciencedirect.com/science/article/pii/S0005109821000108},
    Volume = {127},
    Year = {2021},
    bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0005109821000108},
    bdsk-url-2 = {https://doi.org/10.1016/j.automatica.2021.109490},
    date-added = {2021-03-10 15:53:03 +0100},
    date-modified = {2021-03-10 15:53:03 +0100},
    doi = {10.1016/j.automatica.2021.109490}
}

@article{LAI2021109490, Abstract = {In this paper, we investigate the verification problem of initial-state detectability (I-detectability) and initial-state opacity (I-opacity) in discrete event systems modeled by unambiguous weighted automata. An I-observer is constructed so as to derive necessary and sufficient conditions for checking strong I-detectability, weak I-detectability, and I-opacity, with exponential complexity. In addition, an approach based on diagnosability analysis is proposed for verifying strong I-detectability. Compared with an I-observer-based approach, the diagnosability-based approach has a lower complexity, and in the case where all the unobservable events in an unambiguous weighted automaton are represented by a unique symbol, the diagnosability-based approach has polynomial complexity.}, Author = {Lai, Aiwen and Lahaye, S{\'e}bastien and Li, Zhiwu}, File = {Initial-state detectability and initial-state opacity of unambiguous weighted automata - 1-s2.0-S0005109821000108-main - t.pdf}, ISSN = {0005-1098}, Journal = {Automatica}, Keywords = {Weighted automaton, Initial state estimation, Initial-state detectability, Initial-state opacity}, Pages = {109490}, Title = {Initial-state detectability and initial-state opacity of unambiguous weighted automata}, URL = {https://www.sciencedirect.com/science/article/pii/S0005109821000108}, Volume = {127}, Year = {2021}, bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0005109821000108}, bdsk-url-2 = {https://doi.org/10.1016/j.automatica.2021.109490}, date-added = {2021-03-10 15:53:03 +0100}, date-modified = {2021-03-10 15:53:03 +0100}, doi = {10.1016/j.automatica.2021.109490} }