Different from the set reachability of probabilistic Boolean networks (PBN s) studied in previous works, this paper focuses on the set reachability under output observation. First, we define the set reachability under output observation. By using the conditional matrix construction method and the recursive method, we propose two criteria for the set reachability under output observation. Finally, we establish a relationship between the observability and reconstructibility of PBN s by determining whether the set is reachable from initial set to target set under output observation. Moreover, we propose an algorithm to analyze the reconstructibility of PBN s by applying the set reachability under output observation.
Set Reachability of Probabilistic Boolean Networks Under Output Observation
Published 2025 in Cybersecurity and Cyberforensics Conference
ABSTRACT
PUBLICATION RECORD
- Publication year
2025
- Venue
Cybersecurity and Cyberforensics Conference
- Publication date
2025-07-28
- Fields of study
Not labeled
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-25 of 25 references · Page 1 of 1
CITED BY
- No citing papers are available for this paper.
Showing 0-0 of 0 citing papers · Page 1 of 1