Optimal infinite scheduling for multi-priced timed automata (Q2475633): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: JOBSHOP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10703-007-0043-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2130136014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of the Job-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Systems: Computation and Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uppaal in a nutshell / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing efficient operation schemes for chemical plants in multi-batch mode / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank

Latest revision as of 17:56, 27 June 2024

scientific article
Language Label Description Also known as
English
Optimal infinite scheduling for multi-priced timed automata
scientific article

    Statements

    Optimal infinite scheduling for multi-priced timed automata (English)
    0 references
    0 references
    0 references
    0 references
    11 March 2008
    0 references
    Priced timed automata
    0 references
    Optimal mean-payoff
    0 references
    0 references
    0 references

    Identifiers