Pages that link to "Item:Q3549124"
From MaRDI portal
The following pages link to Parametric temporal logic for “model measuring” (Q3549124):
Displaying 28 items.
- Automata-theoretic decision of timed games (Q386611) (← links)
- Optimal bounds in parametric LTL games (Q391106) (← links)
- A survey of timed automata for the development of real-time systems (Q394966) (← links)
- An interface theory for service-oriented design (Q407507) (← links)
- Parametric metric interval temporal logic (Q483304) (← links)
- Parametric linear dynamic logic (Q515660) (← links)
- Time-budgeting: a component based development methodology for real-time embedded systems (Q736795) (← links)
- From liveness to promptness (Q1039845) (← links)
- Decision problems for lower/upper bound parametric timed automata (Q1041291) (← links)
- Distributed synthesis for parameterized temporal logics (Q1784965) (← links)
- Some results on parametric temporal logic (Q1944185) (← links)
- A fuzzy real-time temporal logic (Q2353964) (← links)
- Time window temporal logic (Q2402278) (← links)
- Parameterized linear temporal logics meet costs: still not costlier than LTL (Q2413483) (← links)
- Decidable first-order transition logics for PA-processes (Q2575856) (← links)
- Robust, expressive, and quantitative linear temporal logics: pick any two for free (Q2672232) (← links)
- Prompt Interval Temporal Logic (Q2835872) (← links)
- Optimal strategy synthesis for request-response games (Q3465629) (← links)
- What’s Decidable About Parametric Timed Automata? (Q4686606) (← links)
- (Q5013884) (← links)
- (Q5015281) (← links)
- (Q5015286) (← links)
- (Q5020519) (← links)
- (Q5021006) (← links)
- Quantifying Bounds in Strategy Logic (Q5079747) (← links)
- Compositional Branching-Time Measurements (Q5170747) (← links)
- Optimizing Winning Strategies in Regular Infinite Games (Q5448640) (← links)
- Taming large bounds in synthesis from bounded-liveness specifications (Q6536131) (← links)
