What’s Decidable About Parametric Timed Automata? (Q4686606): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric temporal logic for “model measuring” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric real-time reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer-complete synthesis for bounded parametric timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language Preservation Problems in Parametric Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low dimensional hybrid systems -- decidable, undecidable, don't know / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language Emptiness of Continuous-Time Parametric Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Interrupt Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustness in Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems for lower/upper bound parametric timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Model-Checking: Parameters everywhere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Parametric Real-Time Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timed verification of the generic architecture of a memory circuit using parametric timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust parametric reachability for 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: The expressive power of clocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking for real-time systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear parametric model checking of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Model Checking for Parametric Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uppaal in a nutshell / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4994958 / rank
 
Normal rank

Latest revision as of 17:35, 16 July 2024

scientific article; zbMATH DE number 6946588
Language Label Description Also known as
English
What’s Decidable About Parametric Timed Automata?
scientific article; zbMATH DE number 6946588

    Statements

    What’s Decidable About Parametric Timed Automata? (English)
    0 references
    0 references
    2 October 2018
    0 references
    0 references
    0 references
    0 references

    Identifiers