Costs and rewards in priced timed automata (Q2064528): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MathSAT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3100414354 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1803.01914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5002811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal infinite scheduling for multi-priced timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking One-clock Priced Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On model-checking timed automata with stopwatch observers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal reachability for multi-priced timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: What's decidable about hybrid automata? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the integer solutions of quadratic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2849590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal reachability problem of weighted timed automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:28, 27 July 2024

scientific article
Language Label Description Also known as
English
Costs and rewards in priced timed automata
scientific article

    Statements

    Costs and rewards in priced timed automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 January 2022
    0 references
    priced timed automata
    0 references
    Pareto domination
    0 references
    Diophantine equations
    0 references

    Identifiers

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