Formal language properties of hybrid systems with strong resets (Q5190079): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016804059 / 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: Formal Methods for the Design of Real-Time Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-checking in dense real-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Event-clock automata: a determinizable class of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3839068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4807830 / 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: Undecidability Results for Timed Automata with Silent Transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets / 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: On the expressiveness and decidability of o-minimal hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Systems: Computation and Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic and \(p\)-recognizable sets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composing Semi-algebraic O-Minimal Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4392286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable Problems About Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What's decidable about hybrid automata? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timed automata and recognizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definable Sets in Ordered Structures. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: O-minimal hybrid systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid systems. Computation and control. 1st international workshop, HSCC '98, Berkeley, CA, USA, April 13--15, 1998. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definable Sets in Ordered Structures. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Folk theorems on the determinization and minimization of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function / rank
 
Normal rank

Latest revision as of 12:49, 2 July 2024

scientific article; zbMATH DE number 5681089
Language Label Description Also known as
English
Formal language properties of hybrid systems with strong resets
scientific article; zbMATH DE number 5681089

    Statements

    Formal language properties of hybrid systems with strong resets (English)
    0 references
    0 references
    0 references
    0 references
    12 March 2010
    0 references
    hybrid systems with strong resets
    0 references
    formal language theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers