Abstract
A probabilistic Boolean network (PBN) is a collection of Boolean networks endowed with a probability structure describing the likelihood with which a constituent network is active at each time step. This paper proposes a definition of bisimulation for PBNs. The notion is inspired by the analogous notions for probabilistic chains and for stochastic linear systems. Necessary and sufficient conditions to check the proposed notion are derived, model reduction of PBNs via bisimulation is addressed, and a discussion on the use of probabilistic bisimulation for optimal control design is given. The present results extend the theory of bisimulation known for deterministic Boolean networks to a stochastic setting.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.