Periodic scheduling of marked graphs using balanced binary words (Q1758156): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Marked directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Un domaine très ouvert : les problèmes d'ordonnancement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Choice Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations on Christoffel words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sturmian words, Lyndon words and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple characterization of Sturm numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4894810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced sequences and optimal routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstraction of Clocks in Synchronous Data-Flow Systems / rank
 
Normal rank

Latest revision as of 21:08, 5 July 2024

scientific article
Language Label Description Also known as
English
Periodic scheduling of marked graphs using balanced binary words
scientific article

    Statements

    Periodic scheduling of marked graphs using balanced binary words (English)
    0 references
    0 references
    0 references
    8 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    connected marked graphs
    0 references
    scheduling graphs
    0 references
    balanced binary word
    0 references
    0 references
    0 references