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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
