A Weighted Pair Graph Representation for Reconstructibility of Boolean Control Networks

DOI10.1137/140991285zbMath1350.93048arXiv1512.02786OpenAlexW2963546858MaRDI QIDQ2833528

Kuize Zhang, Rong Su, Li-jun Zhang

Publication date: 18 November 2016

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.02786

zbMATH Keywords

reconstructibilityfinite automatonformal languageBoolean control networkweighted pair graphsemitensor product of matrices

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80) Applications of graph theory to circuits and networks (94C15) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Mathematical biology in general (92B99)

Related Items

Detectability of Boolean networks with disturbance inputs, Observability of Boolean control networks with time-variant delays in states, A matrix-based approach to verifying stability and synthesizing optimal stabilizing controllers for finite-state automata, Synthesis for observability of logical control networks, On quotients of Boolean control networks, On detectability of Boolean control networks, A survey on observability of Boolean control networks, Bisimulations of Probabilistic Boolean Networks, Robust minimal strong reconstructibility problem of Boolean control networks, Finite automata approach to observability of switched Boolean control networks, On detectability of labeled Petri nets and finite automata, Bisimulations of Boolean Control Networks, Detectability of Boolean networks: a finite-time convergent matrix approach, A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems, Detectability verification of probabilistic Boolean networks, Matrix approach to detectability of discrete event systems, Detectability of labeled weighted automata over monoids, Reduction and Analysis of Boolean Control Networks by Bisimulation, On reconstructibility of switched Boolean control networks

Uses Software

• UMDES

Cites Work

• Unnamed Item
• Identification of Boolean control networks
• Input-state incidence matrix of Boolean control networks and its applications
• String execution time for finite languages: max is easy, min is hard
• A note on observability of Boolean control networks
• Invertibility and nonsingularity of Boolean control networks
• Finite automata approach to observability of switched Boolean control networks
• Controllability and observability of Boolean control networks
• Analysis and control of Boolean networks. A semi-tensor product approach.
• On observability of discrete-event systems
• Decentralized supervisory control of discrete-event systems
• Control of Boolean networks: hardness results and algorithms for tree structured networks
• Observability of Boolean networks: a graph-theoretic approach
• Controllability and observability of Boolean networks arising from biology
• Minimum-Time Control of Boolean Networks
• Observability conditions of Boolean control networks
• Fault Detection Analysis of Boolean Control Networks
• Graph Algorithms
• Introduction to Discrete Event Systems
• Supervisory Control of a Class of Discrete Event Processes
• Towards an Abstract Internal Model Principle
• A Linear Representation of Dynamics of Boolean Networks
• Detectability of Discrete Event Systems
• Observability, Reconstructibility and State Observers of Boolean Control Networks
• Control of Networked Discrete Event Systems: Dealing with Communication Delays and Losses