{
  "id": "1908.09604",
  "version": "v1",
  "published": "2019-08-26T11:34:02.000Z",
  "updated": "2019-08-26T11:34:02.000Z",
  "title": "Verification of Detectability Using Petri Nets and Detector",
  "authors": [
    "Hao Lan",
    "Yin Tong",
    "Jin Guo",
    "Carla Seatzu"
  ],
  "comment": "8 pages, 5 figures. arXiv admin note: substantial text overlap with arXiv:1903.09298, arXiv:1903.07827",
  "categories": [
    "eess.SY",
    "cs.SY"
  ],
  "abstract": "Detectability describes the property of a system to uniquely determine, after a finite number of observations, the current and subsequent states. In this paper, to reduce the complexity of checking the detectability properties in the framework of bounded labeled Petri nets, we use a new tool, which is called detector, to verifying the strong detectability and periodically strong detectability. First, an approach, which is based on the reachable graph and its detector, is proposed. Then, we develop a novel approach which is based on the analysis of the detector of the basis reachability graph. Without computing the whole reachability space, and without building the observer, the proposed approaches are more efficient.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-08-26T11:34:02.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "verification",
      "basis reachability graph",
      "bounded labeled petri nets",
      "finite number",
      "novel approach"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 8,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}