On Boolean control networks with maximal topological entropy
DOI10.1016/j.automatica.2014.10.020zbMath1300.93092arXiv1407.1431OpenAlexW2063054784MaRDI QIDQ473325
Dmitriy Laschov, Michael Margaliot
Publication date: 24 November 2014
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.1431
computational complexitysymbolic dynamicstopological entropyPerron-Frobenius theoryBoolean control networksalgebraic state-space representation
Discrete-time control/observation systems (93C55) Complexity and performance of numerical algorithms (65Y20) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Related Items (6)
Cites Work
- Unnamed Item
- Controllability of Boolean control networks via the Perron-Frobenius theory
- Identification of Boolean control networks
- Controllability of Boolean control networks with time delays in states
- Controllability and observability of Boolean control networks
- Analysis and control of Boolean networks. A semi-tensor product approach.
- Control of switching nets
- Boolean dynamics of networks with scale-free topology
- Boolean network analysis of a neurotransmitter signaling pathway
- Control of Boolean networks: hardness results and algorithms for tree structured networks
- Observability of Boolean networks: a graph-theoretic approach
- Symbolic dynamics of Boolean control networks
- Minimum-Time Control of Boolean Networks
- Matrix Analysis
- An Introduction to Symbolic Dynamics and Coding
- Disturbance Decoupling of Boolean Control Networks
- A Maximum Principle for Single-Input Boolean Control Networks
- Optimal Control of Logical Control Networks
- Observability, Reconstructibility and State Observers of Boolean Control Networks
- Linear analysis of switching nets
This page was built for publication: On Boolean control networks with maximal topological entropy