Pages that link to "Item:Q4221299"
From MaRDI portal
The following pages link to On the decidability of continuous time specification formalisms (Q4221299):
Displaying 17 items.
- Quantifier-free encoding of invariants for hybrid systems (Q479826) (← links)
- The complexity of temporal logic over the reals (Q636345) (← links)
- HRELTL: a temporal logic for hybrid systems (Q897648) (← links)
- Decidable metric logics (Q999264) (← links)
- The complexity of the temporal logic with ``until'' over general linear time (Q1400578) (← links)
- Proving properties of continuous systems: Qualitative simulation and temporal logic (Q1402734) (← links)
- Finite variability interpretation of monadic logic of order (Q1606122) (← links)
- Timer formulas and decidable metric temporal logic (Q1780454) (← links)
- Expressive completeness of duration calculus. (Q1854330) (← links)
- \textsc{LTL} falsification in infinite-state systems (Q2105460) (← links)
- SMT-based satisfiability of first-order LTL with event freezing functions and metric operators (Q2182731) (← links)
- Decidability of a hybrid duration calculus (Q2867952) (← links)
- A duration calculus with neighborhood modalities (Q2901191) (← links)
- Metric temporal reasoning with less than two clocks (Q2901203) (← links)
- (Q3384172) (← links)
- Justification announcements in discrete time. Part II: Frame definability results (Q5241923) (← links)
- A first order logic for specification of timed algorithms: Basic properties and a decidable class (Q5957904) (← links)