Linear control of live marked graphs (Q1868050): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0005-1098(02)00266-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970634745 / rank
 
Normal rank

Latest revision as of 09:08, 30 July 2024

scientific article
Language Label Description Also known as
English
Linear control of live marked graphs
scientific article

    Statements

    Linear control of live marked graphs (English)
    0 references
    0 references
    0 references
    0 references
    27 April 2003
    0 references
    Given a linear constraint on the firing vectors of a live marked graph with uncontrollable/unobservable transitions, bounded or unbounded, the authors apply linear programming techniques to compute the most liberal controller enforcing this constraint. This approach is therefore different from the control based on monitor places, considered e.g. by \textit{K. Yamalidou, J. Moody, M. Lemmon} and \textit{P. Antsaklis} [Automatica 32, No. 1, 15-28 (1996; Zbl 0845.93034)], because the latter fails to deal with uncontrollable and unobservable transitions. The authors borrow the framework of vector discrete event systems considered by \textit{Y. Li} and \textit{W. M. Wonham} [IEEE Trans. Autom. Control 38, No. 8, 1214-1227 (1993; Zbl 0784.93007); ibid. 39, No. 3, 512-531 (1994; Zbl 0823.93003)], but analyze the more general control problem by restricting systems to live marked graphs. As close work, the paper by \textit{H. Chen} [Discrete Event Dyn. Syst. 10, No. 3, 233-249 (2000; Zbl 0958.93064)] can be mentioned. The distinction is in the consideration of unobservable transitions and more general constraints. On the other hand, the proposed controller provides only interpreted control (verification of controlled systems is problematic) and does not preserve liveness of the uncontrolled net. Some interesting examples are given to illustrate the results of the paper.
    0 references
    marked graphs
    0 references
    firing vectors
    0 references
    linear constraints
    0 references
    supervision
    0 references
    liveness
    0 references
    polyhedra
    0 references
    linear programming
    0 references
    unobservable transitions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references