Abstract
In this letter, observability and reconstructibility properties of probabilistic boolean networks (PBNs) on a finite time interval are addressed. By assuming that the state update follows a probabilistic rule, while the output is a deterministic function of the state, we investigate under what conditions the knowledge of the output measurements in $[0{,}T]$ allows the exact identification either of the initial state or of the final state of the PBN. By making use of the algebraic approach to PBNs, the concepts of observability, weak reconstructibility, and strong reconstructibility are introduced and characterized. Set theoretic algorithms to determine all possible initial/final states compatible with the given output sequence are provided.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
