Boolean monomial control systems

Delgado-Eckert, Edgar

doi:10.1080/13873950902808594

Cited by 5 publications

(6 citation statements)

References 80 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This result was proved in Theorem 4.13 of Colón-Reyes et al (2004). A slightly simpler proof can be found in Delgado-Eckert (2009b), Corollary 2.20.…”

Section: Proof See Lemma 42 In Colón-reyes Et Al (2004)mentioning

confidence: 76%

“…This corresponds to the choice of a suitable feedback controller. The details and proof of this stabilizability statement as well as a brief description of a stabilization procedure can be found in Delgado-Eckert (2009b).…”

Section: State Feedback Controller Design For Boolean Monomial Contromentioning

confidence: 98%

“…In this context, the DES analysis is interested in inherent structural properties of autonomous DES. For instance, it is sought to determine cyclic or fixed-point behavior along with system states that belong to cycles or that lead to a fixed point ((Delgado-Eckert, 2009b;Plantin et al, 1995;Reger & Schmidt, 2004)). In addition, it is desired to determine the depth of directed trees and the states that belong to trees in the phase space of DES.…”

Section: Discrete Event Systems Analysismentioning

confidence: 99%

“…The structural similarity demonstrated in Remark 53 then enables the extension of the results to more general cases. A rigorous implementation of the ideas developed here can be found in Delgado-Eckert (2009b). As explained in Remark 53, a Boolean monomial dynamical system with a strongly connected non-trivial dependency graph can be visualized as a simple cycle of loop-equivalence classes (see Fig.…”

Section: State Feedback Controller Design For Boolean Monomial Contromentioning

confidence: 99%

See 3 more Smart Citations

Discrete Time Systems with Event-Based Dynamics: Recent Developments in Analysis and Synthesis Methods

Delgado-Eckert¹,

Reger²,

Schmidt³

2011

Discrete Time Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…This result was proved in Theorem 4.13 of Colón-Reyes et al (2004). A slightly simpler proof can be found in Delgado-Eckert (2009b), Corollary 2.20.…”

Section: Proof See Lemma 42 In Colón-reyes Et Al (2004)mentioning

confidence: 76%

Section: State Feedback Controller Design For Boolean Monomial Contromentioning

confidence: 98%

Section: Discrete Event Systems Analysismentioning

confidence: 99%

Section: State Feedback Controller Design For Boolean Monomial Contromentioning

confidence: 99%

See 2 more Smart Citations

Discrete Time Systems with Event-Based Dynamics: Recent Developments in Analysis and Synthesis Methods

Delgado-Eckert¹,

Reger²,

Schmidt³

2011

Discrete Time Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…Apart from modeling, control issues have also been addressed for discrete systems in the literature. The issues of controllability, reachability and state feedback control have been investigated using different approaches such as the theory of polynomial dynamical systems [15], graph theory [16,17], max-plus algebra [18,19], finite field theory [14,20], discrete abstraction and state transition graphs [5], linear modular systems [21] to name a few. Observability for DDSs has also been the subject of a number of research works.…”

mentioning

confidence: 99%

On persistent excitations for the identification of switched linear dynamical systems over finite fields

Millérioux

Daafouz

2014

Automatica

View full text Add to dashboard Cite

International audienceThis paper discusses the issue of the Persistent Excitation (PE) conditions in the context of identification for dynamical systems defined over a finite field. The work is motivated by the fact that the asymptotical property of the PE conditions for dynamical systems defined over the field of real numbers is no longer valid in the case of systems defined over finite fields. The special class of switched linear discrete-time systems for which the mode is assumed to be unknown is considered. A necessary and sufficient condition that provides the minimum amount of data required for the identification is first proposed. Next, a necessary condition is derived that gives the structural condition the system must satisfy, regardless of the availability of data. Finally, some computational aspects are discussed and examples are given to illustrate the validity of the proposed results

show abstract

A Bio-Inspired Method for the Constrained Shortest Path Problem

Wang

et al. 2014

The Scientific World Journal

View full text Add to dashboard Cite

The constrained shortest path (CSP) problem has been widely used in transportation optimization, crew scheduling, network routing and so on. It is an open issue since it is a NP-hard problem. In this paper, we propose an innovative method which is based on the internal mechanism of the adaptive amoeba algorithm. The proposed method is divided into two parts. In the first part, we employ the original amoeba algorithm to solve the shortest path problem in directed networks. In the second part, we combine the Physarum algorithm with a bio-inspired rule to deal with the CSP. Finally, by comparing the results with other method using an examples in DCLC problem, we demonstrate the accuracy of the proposed method.

show abstract

Boolean monomial control systems

Cited by 5 publications

References 80 publications

Discrete Time Systems with Event-Based Dynamics: Recent Developments in Analysis and Synthesis Methods

Discrete Time Systems with Event-Based Dynamics: Recent Developments in Analysis and Synthesis Methods

On persistent excitations for the identification of switched linear dynamical systems over finite fields

A Bio-Inspired Method for the Constrained Shortest Path Problem

Contact Info

Product

Resources

About