A weighted pair graph representation for reconstructibility of Boolean control networks
From MaRDI portal
Boolean control networkformal languagefinite automatonreconstructibilityweighted pair graphsemitensor product of matrices
Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80) Mathematical biology in general (92B99) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Applications of graph theory to circuits and networks (94C15)
Abstract: A new concept of weighted pair graphs (WPGs) is proposed to represent a new reconstructibility definition for Boolean control networks (BCNs), which is a generalization of the reconstructibility definition given in [Fornasini & Valcher, TAC2013, Def. 4]. Based on the WPG representation, an effective algorithm for determining the new reconstructibility notion for BCNs is designed with the help of the theories of finite automata and formal languages. We prove that a BCN is not reconstructible iff its WPG has a complete subgraph. Besides, we prove that a BCN is reconstructible in the sense of [Fornasini & Valcher, TAC2013, Def. 4] iff its WPG has no cycles, which is simpler to be checked than the condition in [Fornasini & Valcher, TAC2013, Thm. 4].
Recommendations
- Reconstructibility of Boolean control networks with time delays in states.
- On reconstructibility of switched Boolean control networks
- On detectability of Boolean control networks
- Invertibility and nonsingularity of Boolean control networks
- Graph theory methods for decomposition w.r.t. outputs of Boolean control networks
Cites work
- A Linear Representation of Dynamics of Boolean Networks
- A note on observability of Boolean control networks
- An introduction to formal languages and automata.
- Analysis and control of Boolean networks. A semi-tensor product approach.
- Control of Boolean networks: hardness results and algorithms for tree structured networks
- Control of networked discrete event systems: dealing with communication delays and losses
- Controllability and observability of Boolean control networks
- Controllability and observability of Boolean networks arising from biology
- Decentralized supervisory control of discrete-event systems
- Detectability of Discrete Event Systems
- Fault Detection Analysis of Boolean Control Networks
- Finite automata approach to observability of switched Boolean control networks
- Graph algorithms. Edited by Guy Even. With a foreword by Richard M. Karp
- Identification of Boolean control networks
- Input-state incidence matrix of Boolean control networks and its applications
- Introduction to Discrete Event Systems
- Invertibility and nonsingularity of Boolean control networks
- Minimum-time control of Boolean networks
- Observability conditions of Boolean control networks
- Observability of Boolean networks: a graph-theoretic approach
- Observability, Reconstructibility and State Observers of Boolean Control Networks
- On observability of discrete-event systems
- String execution time for finite languages: max is easy, min is hard
- Supervisory Control of a Class of Discrete Event Processes
- Towards an Abstract Internal Model Principle
Cited in
(26)- Detectability of Boolean networks with disturbance inputs
- Bisimulations of probabilistic Boolean networks
- Robust observability and detectability of boolean networks under function perturbation
- Robust reconstructibility of Boolean networks subject to function perturbation
- Fundamental structures of invariant dual subspaces with respect to a Boolean network
- Bisimulations of Boolean Control Networks
- Observability of Boolean control networks with time-variant delays in states
- Reconstructibility analysis and set-observer design for Boolean control networks
- On detectability of labeled Petri nets and finite automata
- On detectability of Boolean control networks
- Robust minimal strong reconstructibility problem of Boolean control networks
- Synthesis for observability of logical control networks
- On reconstructibility of switched Boolean control networks
- A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems
- Matrix approach to detectability of discrete event systems
- Reduction and analysis of Boolean control networks by bisimulation
- On quotients of Boolean control networks
- Detectability of Boolean networks: a finite-time convergent matrix approach
- Finite automata approach to observability of switched Boolean control networks
- Detectability verification of probabilistic Boolean networks
- A survey on observability of Boolean control networks
- Stabilization of continuous-time probabilistic logical networks under sampling dwell time constraints
- Bisimulations for delayed switched Boolean control networks and its application in controllability
- A matrix-based approach to verifying stability and synthesizing optimal stabilizing controllers for finite-state automata
- Detectability of labeled weighted automata over monoids
- Data informativity for analysis and control design of Boolean control networks
This page was built for publication: A weighted pair graph representation for reconstructibility of Boolean control networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2833528)
