activity
20142026
most citedA Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks

57 citations · 336 across the 51 of their papers we have counts for

collaborators
Showing 2019 · math.OCShow all

1 paper · 2 filters

math.OC2019

No Switching Policy is Optimal for a Positive Linear System with a Bottleneck Entrance

Mahdiar Sadeghi, M. Ali Al-Radhawi, Michael Margaliot +1

We consider a nonlinear SISO system that is a cascade of a scalar "bottleneck entrance" and an arbitrary Hurwitz positive linear system. This system entrains i.e. in response to a…