Abstract
Boolean control networks (BCNs) with temporal logic specifications have great potential to deal with multiple tasks or complex environments. We first express the tasks of BCNs with temporal logic specifications, and transform these specifications into finite time sets dwell problems. By using the semi-tensor product (STP), some results that satisfying the specifications of temporal logic through time-varying control are obtained. Our method provides a unified framework for studying the stabilizability, synchronizability, path planning and other issues of BCNs. The controller design algorithms are then proposed to generate state sequences that fulfill the given tasks as much as possible while minimizing the cost function. Finally, two examples are given to verify the effectiveness of the theoretical results.
Published Version
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.
