Analytic evaluation of the cycle time on networked conflicting timed event graphs in the (Max,+) algebra (Q513811): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Networked conflicting timed event graphs representation in (Max,+) algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Just in time control of constrained \((max,+)\)-linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-Plus Control Design for Temporal Constraints Meeting in Timed Event Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of greatest linear feedback for timed-event graphs in dioid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and analysis of timed Petri nets using heaps of pieces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance evaluation of job-shop systems using timed event-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear periodic systems over dioids / rank
 
Normal rank

Revision as of 12:19, 13 July 2024

scientific article
Language Label Description Also known as
English
Analytic evaluation of the cycle time on networked conflicting timed event graphs in the (Max,+) algebra
scientific article

    Statements

    Analytic evaluation of the cycle time on networked conflicting timed event graphs in the (Max,+) algebra (English)
    0 references
    0 references
    0 references
    8 March 2017
    0 references
    timed event graph
    0 references
    conflicting timed event graphs
    0 references
    (Max,+) algebra
    0 references
    resources sharing
    0 references
    cycle time
    0 references

    Identifiers