Supervisory control of extended timed event graphs (Q1879135): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4304869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supervisory control of real-time discrete-event systems using lattice theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supervisory Control of a Class of Discrete Event Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of realizable behavior in supervisory control of timed event graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulas for the extremal controllable sequences in timed-event graphs / rank
 
Normal rank

Latest revision as of 19:52, 6 June 2024

scientific article
Language Label Description Also known as
English
Supervisory control of extended timed event graphs
scientific article

    Statements

    Supervisory control of extended timed event graphs (English)
    0 references
    0 references
    0 references
    22 September 2004
    0 references
    The dioid formalism is used for exploring the dynamics of extended timed event graphs (ETEGs) related to place delay. The approach to supervisory control of ETEGs yields a necessary and sufficient condition for the ideals of the set of firing time sequences of transitions to be controllable. The paper also shows that all the strongly controllable subsets of the set of firing time sequences of transitions form a complete lattice.
    0 references
    supervisory control
    0 references
    timed event graphs
    0 references
    dioids
    0 references
    strong controllability
    0 references
    complete lattice
    0 references

    Identifiers