The following pages link to From liveness to promptness (Q1039845):
Displaying 23 items.
- Optimal bounds in parametric LTL games (Q391106) (← links)
- An interface theory for service-oriented design (Q407507) (← links)
- Parametric metric interval temporal logic (Q483304) (← links)
- Parametric linear dynamic logic (Q515660) (← links)
- Cycle detection in computation tree logic (Q1784962) (← links)
- Distributed synthesis for parameterized temporal logics (Q1784965) (← links)
- Beyond \(\omega \)-regular languages: \(\omega T\)-regular expressions and their automata and logic counterparts (Q1989336) (← links)
- Quantitative reductions and vertex-ranked infinite games (Q2029603) (← links)
- Timed games with bounded window parity objectives (Q2112117) (← links)
- Model checking interval temporal logics with regular expressions (Q2182727) (← links)
- Hierarchical cost-parity games (Q2210523) (← links)
- Model checking algorithms for hyperproperties (invited paper) (Q2234054) (← links)
- Natural strategic ability (Q2289013) (← links)
- Looking at mean-payoff and total-payoff through windows (Q2346404) (← links)
- Parameterized linear temporal logics meet costs: still not costlier than LTL (Q2413483) (← links)
- Robust, expressive, and quantitative linear temporal logics: pick any two for free (Q2672232) (← links)
- Prompt Interval Temporal Logic (Q2835872) (← links)
- Delay Games with WMSO+U Winning Conditions (Q2953690) (← links)
- Delay Games with WMSO$$+$$U Winning Conditions (Q3194731) (← links)
- (Q3384174) (← links)
- (Q3384874) (← links)
- Quantifying Bounds in Strategy Logic (Q5079747) (← links)
- Realizability problem for constraint LTL (Q6178458) (← links)
