Number of the records: 1
Deciding detectability for labeled Petri nets
- 1.
SYSNO ASEP 0504048 Document Type J - Journal Article R&D Document Type Journal Article Subsidiary J Článek ve WOS Title Deciding detectability for labeled Petri nets Author(s) Masopust, Tomáš (MU-W) RID, ORCID, SAI
Yin, X. (CN)Source Title Automatica. - : Elsevier - ISSN 0005-1098
Roč. 104, June (2019), s. 238-241Number of pages 4 s. Language eng - English Country NL - Netherlands Keywords discrete event systems ; Petri nets ; complexity Subject RIV BA - General Mathematics OECD category Automation and control systems R&D Projects GC19-06175J GA ČR - Czech Science Foundation (CSF) Method of publishing Limited access Institutional support MU-W - RVO:67985840 UT WOS 000466616600027 EID SCOPUS 85063045219 DOI 10.1016/j.automatica.2019.02.058 Annotation 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. Workplace Mathematical Institute Contact Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757 Year of Publishing 2020 Electronic address http://dx.doi.org/10.1016/j.automatica.2019.02.058
Number of the records: 1