Pages that link to "Item:Q816203"

The following pages link to Checking timed Büchi automata emptiness efficiently (Q816203):

Displaying 20 items.

• Expected reachability-time games (Q278757) (← links)
• A survey of timed automata for the development of real-time systems (Q394966) (← links)
• Efficient emptiness check for timed Büchi automata (Q453519) (← links)
• Finding minimum and maximum termination time of timed automata models with cyclic behaviour (Q507600) (← links)
• Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata (Q517046) (← links)
• On clock-aware LTL parameter synthesis of timed automata (Q1648651) (← links)
• Probabilistic timed automata with clock-dependent probabilities (Q1685793) (← links)
• Verification and control of partially observable probabilistic systems (Q1699230) (← links)
• Certifying emptiness of timed Büchi automata (Q1996011) (← links)
• Iterative bounded synthesis for efficient cycle detection in parametric timed automata (Q2044207) (← links)
• Model checking for probabilistic timed automata (Q2248072) (← links)
• Schedulability of asynchronous real-time concurrent objects (Q2390036) (← links)
• Symbolic Minimum Expected Time Controller Synthesis for Probabilistic Timed Automata (Q2945592) (← links)
• Coarse Abstractions Make Zeno Behaviours Difficult to Detect (Q3090824) (← links)
• Model Checking Real-Time Systems (Q3176387) (← links)
• Strict Divergence for Probabilistic Timed Automata (Q3184704) (← links)
• Stochastic Games for Verification of Probabilistic Timed Automata (Q3648833) (← links)
• Checking Timed Büchi Automata Emptiness Using LU-Abstractions (Q3648834) (← links)
• LTL Parameter Synthesis of Parametric Timed Automata (Q4571131) (← links)
• Distributed parametric model checking timed automata under non-zenoness assumption (Q6108439) (← links)