scispace - formally typeset
Search or ask a question
Author

Eyal Weiss

Other affiliations: Bar-Ilan University
Bio: Eyal Weiss is an academic researcher from Tel Aviv University. The author has contributed to research in topics: Orthant & Dynamical systems theory. The author has an hindex of 6, co-authored 11 publications receiving 106 citations. Previous affiliations of Eyal Weiss include Bar-Ilan University.

Papers
More filters
Journal ArticleDOI
TL;DR: This work provides a necessary and sufficient condition for observability of a CBN with $n$ SVs and an efficient algorithm for solving the minimal observability problem for an important special class of Boolean networks, called conjunctive BNs (CBNs).
Abstract: Many complex systems in biology, physics, and engineering include a large number of state variables (SVs), and measuring the full state of the system is often impossible. Typically, a set of sensors is used to measure a part of the SVs. A system is called observable if these measurements allow to reconstruct the entire state of the system. When the system is not observable, an important and practical problem is how to add a minimal number of sensors so that the system becomes observable. This minimal observability problem is practically useful and theoretically interesting, as it pinpoints the most informative nodes in the system. We consider the minimal observability problem for an important special class of Boolean networks (BNs), called conjunctive BNs (CBNs). Using a graph-theoretic approach, we provide a necessary and sufficient condition for observability of a CBN with $n$ SVs and an efficient algorithm for solving the minimal observability problem. The algorithm time complexity is linear in the length of the description of the CBN and in particular it is $O(n^2)$ . We demonstrate the usefulness of these results by studying the properties of a class of randomly generated CBNs.

42 citations

Journal ArticleDOI
TL;DR: In this paper, the problem of finding a minimal set of state-variables to directly affect with an input so that the resulting conjunctive Boolean control network is controllable is studied.

36 citations

Journal ArticleDOI
TL;DR: In this article, a generalization of positive linear systems, called k-positive linear systems (k-SLS), was proposed, which admits certain explicit invariant sets, and for k = 2 establishes the Poincare-Bendixson property for any bounded trajectory.

27 citations

Journal ArticleDOI
01 Jan 2019
Abstract: We derive a new graph-theoretic sufficient condition for observability of a Boolean control network (BCN). We describe two algorithms that are based on this condition. The first selects a set of nodes so that observing this set makes the BCN observable. The second algorithm builds an observer for the observable BCN. Both algorithms are sub-optimal, as they are based on a sufficient but not necessary condition for observability. Yet their time-complexity is linear in the length of the description of the BCN, rendering them feasible for large-scale BCNs. We discuss how these results can be used to provide a sub-optimal yet polynomial-complexity algorithm for the minimal observability problem in BCNs. Some of the theoretical results are demonstrated using BCN models of mammalian cell cycle control, and T-cell receptor kinetics.

16 citations

Journal ArticleDOI
TL;DR: In this article, a graph-theoretic approach was used to derive a new sufficient condition for observability of a Boolean control network (BCN) based on graph theory.
Abstract: Using a graph-theoretic approach, we derive a new sufficient condition for observability of a Boolean control network (BCN). Based on this condition, we describe two algorithms: the first selects a set of nodes so that observing this set makes the BCN observable. The second algorithm builds an observer for the observable BCN. Both algorithms are sub-optimal, as they are based on a sufficient but not necessary condition for observability. Yet their time-complexity is linear in the length of the description of the BCN, rendering them feasible for large-scale networks. We discuss how these results can be used to provide a sub-optimal yet polynomial-complexity algorithm for the minimal observability problem in BCNs. Some of the theoretical results are demonstrated using a BCN model of the core network regulating the mammalian cell cycle.

12 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: The block decoupling problem is equivalently converted into the solvability of a set of logical matrix equations and the approaches to solve these equations are designed, based on which the suitable coordinate transformations and open-loop controllers can be determined.
Abstract: In this paper, the block decoupling of Boolean control networks is investigated via solving logical matrix equations. First, the definition of block decoupling of Boolean control networks is proposed. Second, the block decoupling problem is equivalently converted into the solvability of a set of logical matrix equations. Subsequently, the approaches to solve these equations are designed, based on which the suitable coordinate transformations and open-loop controllers can be determined. Finally, an illustrative example is given to show the effectiveness of the main results.

97 citations

01 Jan 2016
TL;DR: The totally positive matrices is universally compatible with any devices to read and is available in the authors' digital library an online access to it is set as public so you can get it instantly.
Abstract: Thank you for reading totally positive matrices. Maybe you have knowledge that, people have search numerous times for their favorite books like this totally positive matrices, but end up in harmful downloads. Rather than enjoying a good book with a cup of tea in the afternoon, instead they cope with some malicious bugs inside their computer. totally positive matrices is available in our digital library an online access to it is set as public so you can get it instantly. Our books collection saves in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Kindly say, the totally positive matrices is universally compatible with any devices to read.

95 citations

Journal ArticleDOI
TL;DR: An improved method via combining the well known Tarjan's algorithm and depth-first search technique for the controllability analysis of Boolean control networks (BCNs) is proposed and can be more efficient than the conventional method used in the recent paper.
Abstract: This note presents further results based on the recent paper [J. Liang, H. Chen, and J. Lam, “An improved criterion for controllability of Boolean control networks,” IEEE Trans. Autom. Control , vol. 62, no. 11, pp. 6012–6018, Nov. 2017]. After some optimizations, the conventional method can be more efficient than the method used in the above paper. We also propose an improved method via combining the well known Tarjan's algorithm and depth-first search technique for the controllability analysis of Boolean control networks (BCNs). As a result, the computational complexity will not exceed $O(N^2)$ with $N=2^n$ , where $n$ is the number of state-variables in a BCN.

82 citations

01 Jan 2014
TL;DR: Monotone dynamical systems Stability and convergence Competitive and cooperative differential equations Irreducible cooperative systems Cooperative systems of delay differential equations Quasimonotone systems of parabolic equations A competition model Appendix Bibliography.
Abstract: Monotone dynamical systems Stability and convergence Competitive and cooperative differential equations Irreducible cooperative systems Cooperative systems of delay differential equations Nonquasimonotone delay differential equations Quasimonotone systems of parabolic equations A competition model Appendix Bibliography.

65 citations

Journal ArticleDOI
TL;DR: It is proved that the set stability of SDLNs is equivalent to the set Stability of the algebraic form with respect to trajectory, and a new necessary and sufficient condition is presented for the finite-field consensus.

56 citations