Optimal Reachability in Divergent Weighted Timed Games (Q2988366): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2575538450 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1701.03716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal paths in weighted timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal reachability problem of weighted timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved undecidability results on weighted timed automata / 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: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Value Problem in Weighted Timed Games. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energy and mean-payoff timed games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Modeling and Analysis of Timed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5275374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5357711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding Negative Prices to Priced Timed Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Reachability in Divergent Weighted Timed Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Algorithm for Solving One-Clock Priced Timed Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of quantifiers is better than number of tape cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Space is Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability-Time Games on Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On short paths interdiction problems: Total and node-wise limited interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamical properties of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of forced enumeration for nondeterministic automata / rank
 
Normal rank

Latest revision as of 19:54, 13 July 2024

scientific article
Language Label Description Also known as
English
Optimal Reachability in Divergent Weighted Timed Games
scientific article

    Statements

    Optimal Reachability in Divergent Weighted Timed Games (English)
    0 references
    0 references
    0 references
    0 references
    19 May 2017
    0 references

    Identifiers