Back to Search
Start Over
Detectability vverification of probabilistic Boolean networks
- Source :
- Information Sciences. 548:313-327
- Publication Year :
- 2021
- Publisher :
- Elsevier BV, 2021.
-
Abstract
- We in this paper study the current-state estimation problem of probabilistic Boolean networks with output observations. First, we propose the concepts of three fundamental categories of detectability in the context of PBNs based on the different purposes, which are periodic detectability, (periodic) k-detectability, and (periodic) d-detectability. Second, utilizing the semi-tensor product technique, we create a uniform methodology for the verification of all the aforementioned categories of detectability. Accordingly, several necessary and sufficient verification criteria are derived. All results obtained in this paper are numerically tractable since they avoid the graph-based symbolic manipulations. Finally, several examples modeled by the same PBN are provided to instantiate the correctness and effeteness of the obtained results.
- Subjects :
- Information Systems and Management
Correctness
Theoretical computer science
Computer science
05 social sciences
Probabilistic logic
050301 education
Context (language use)
02 engineering and technology
Computer Science Applications
Theoretical Computer Science
Artificial Intelligence
Control and Systems Engineering
Product (mathematics)
0202 electrical engineering, electronic engineering, information engineering
Graph (abstract data type)
020201 artificial intelligence & image processing
0503 education
Software
Subjects
Details
- ISSN :
- 00200255
- Volume :
- 548
- Database :
- OpenAIRE
- Journal :
- Information Sciences
- Accession number :
- edsair.doi...........214992ac9f86aaca8e1efb5edf049e27