Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets (Q3543289): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-85778-5_6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1494167205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algorithmic analysis of hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: O-minimal hybrid systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressiveness and decidability of o-minimal hybrid systems / 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: Q4552456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability-Time Games on Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Systems: Computation and Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the undecidability of the reachability problem for o-minimal dynamical systems / 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: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on real structural complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382287 / rank
 
Normal rank

Latest revision as of 20:50, 28 June 2024

scientific article
Language Label Description Also known as
English
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
scientific article

    Statements

    Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 December 2008
    0 references

    Identifiers