The following pages link to (Q4953401):
Displayed 28 items.
- A survey of timed automata for the development of real-time systems (Q394966) (← links)
- On parametric timed automata and one-counter machines (Q515666) (← links)
- Robust parametric reachability for timed automata (Q846009) (← links)
- Temporal logics with incommensurable distances are undecidable (Q879597) (← links)
- On clock-aware LTL parameter synthesis of timed automata (Q1648651) (← links)
- PTIME parametric verification of safety properties for reasonable linear hybrid automata (Q1949771) (← links)
- Revisiting reachability in polynomial interrupt timed automata (Q2059890) (← links)
- Consistency in parametric interval probabilistic timed automata (Q2291816) (← links)
- Model measuring for discrete and hybrid systems (Q2374564) (← links)
- On the expressiveness and decidability of o-minimal hybrid systems (Q2387414) (← links)
- Polynomial interrupt timed automata: verification and expressiveness (Q2662502) (← links)
- Classes of Timed Automata and the Undecidability of Universality (Q2842589) (← links)
- Language Preservation Problems in Parametric Timed Automata (Q2945580) (← links)
- Deciding Concurrent Planar Monotonic Linear Hybrid Systems (Q2945600) (← links)
- Model Checking Real-Time Systems (Q3176387) (← links)
- Verification of Hybrid Systems (Q3176388) (← links)
- Decidable Compositions of O-Minimal Automata (Q3540076) (← links)
- Property Driven Three-Valued Model Checking on Hybrid Automata (Q3638286) (← links)
- LTL Parameter Synthesis of Parametric Timed Automata (Q4571131) (← links)
- What’s Decidable About Parametric Timed Automata? (Q4686606) (← links)
- Approximated Reachability on Hybrid Automata: Falsification meets Certification (Q4982085) (← links)
- (Q4989408) (← links)
- Parametric Schedulability Analysis of a Launcher Flight Control System under Reactivity Constraints* (Q5025034) (← links)
- (Q5094115) (← links)
- Formal language properties of hybrid systems with strong resets (Q5190079) (← links)
- (Q5208876) (← links)
- Equivalence checking and intersection of deterministic timed finite state machines (Q6108432) (← links)
- Distributed parametric model checking timed automata under non-zenoness assumption (Q6108439) (← links)