Pages that link to "Item:Q689093"
From MaRDI portal
The following pages link to Real-time logics: Complexity and expressiveness (Q689093):
Displayed 50 items.
- Metric temporal logic revisited (Q266865) (← links)
- Adequacy and complete axiomatization for timed modal logic (Q283762) (← links)
- Checking EMTLK properties of timed interpreted systems via bounded model checking (Q310082) (← links)
- Optimal bounds in parametric LTL games (Q391106) (← links)
- A temporal logic for micro- and macro-step-based real-time systems: foundations and applications (Q530560) (← links)
- A contract-based approach to adaptivity (Q541295) (← links)
- The complexity of temporal logic over the reals (Q636345) (← links)
- Modular abstractions for verifying real-time distributed systems (Q685095) (← links)
- Robustness of temporal logic specifications for continuous-time signals (Q732015) (← links)
- Time-budgeting: a component based development methodology for real-time embedded systems (Q736795) (← links)
- Continuous KAOS, ASM, and formal control system design across the continuous/discrete modeling interface: a simple train stopping application (Q736916) (← links)
- Timed hyperproperties (Q821560) (← links)
- Invariant-driven specifications in Maude (Q838161) (← links)
- An automata-theoretic approach to constraint LTL (Q870361) (← links)
- HRELTL: a temporal logic for hybrid systems (Q897648) (← links)
- Decidable metric logics (Q999264) (← links)
- Programming in metric temporal logic (Q1128978) (← links)
- Using mappings to prove timing properties (Q1200918) (← links)
- Planning control rules for reactive agents (Q1389598) (← links)
- A process algebra of communicating shared resources with dense time and priorities (Q1389685) (← links)
- Two-sorted metric temporal logics (Q1391098) (← links)
- Pushdown timed automata: A binary reachability characterization and safety verification. (Q1401320) (← links)
- Proving properties of continuous systems: Qualitative simulation and temporal logic (Q1402734) (← links)
- Verification of reactive systems using temporal logic with clocks (Q1575841) (← links)
- Solving multi-granularity temporal constraint networks (Q1614864) (← links)
- LARS: a logic-based framework for analytic reasoning over streams (Q1648076) (← links)
- Timer formulas and decidable metric temporal logic (Q1780454) (← links)
- Decidability results for metric and layered temporal logics (Q1815429) (← links)
- Min-max event-triggered computation tree logic (Q1847543) (← links)
- Decidable integration graphs. (Q1854273) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- Presburger liveness verification of discrete timed automata. (Q1874402) (← links)
- Compositional verification of real-time systems with explicit clock temporal logic (Q1918934) (← links)
- Timeline-based planning over dense temporal domains (Q1989337) (← links)
- Embedding online runtime verification for fault disambiguation on Robonaut2 (Q1996030) (← links)
- One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\) (Q2029608) (← links)
- Can you answer while you wait? (Q2103911) (← links)
- Context-free timed formalisms: robust automata and linear temporal logics (Q2113377) (← links)
- Decidability and complexity of action-based temporal planning over dense time (Q2124463) (← links)
- SMT-based satisfiability of first-order LTL with event freezing functions and metric operators (Q2182731) (← links)
- Theorem proving for pointwise metric temporal logic over the naturals via translations (Q2228435) (← links)
- ``Most of'' leads to undecidability: failure of adding frequencies to LTL (Q2233396) (← links)
- On the expressiveness of TPTL and MTL (Q2266987) (← links)
- Efficient timed model checking for discrete-time systems (Q2368994) (← links)
- Bounded variability of metric temporal logic (Q2408743) (← links)
- Parameterized model checking of weighted networks (Q2447757) (← links)
- LTL over integer periodicity constraints (Q2503321) (← links)
- Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past (Q2842605) (← links)
- Timed CSP = Closed Timed Automata1 (Q2842610) (← links)
- Metric temporal reasoning with less than two clocks (Q2901203) (← links)