Abstract
In this paper, the reachability of probabilistic Boolean multiplex control network is discussed. First, the probabilistic Boolean multiplex control network is proposed and transformed into an equivalent algebraic representation. Then, a necessary and sufficient condition for reachability is obtained based on the concept of reachability of probabilistic Boolean multiplex control network. Finally, the obtained result is effectively illustrated by an example.
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.
