On the decidability of continuous time specification formalisms
From MaRDI portal
Recommendations
Cited in
(17)- The complexity of the temporal logic with ``until over general linear time
- Proving properties of continuous systems: Qualitative simulation and temporal logic
- Finite variability interpretation of monadic logic of order
- Timer formulas and decidable metric temporal logic
- Expressive completeness of duration calculus.
- \textsc{LTL} falsification in infinite-state systems
- SMT-based satisfiability of first-order LTL with event freezing functions and metric operators
- Decidability of a hybrid duration calculus
- A duration calculus with neighborhood modalities.
- Metric temporal reasoning with less than two clocks
- Linear-time temporal logic with event freezing functions
- Quantifier-free encoding of invariants for hybrid systems
- Justification announcements in discrete time. Part II: Frame definability results
- A first order logic for specification of timed algorithms: Basic properties and a decidable class
- The complexity of temporal logic over the reals
- HRELTL: a temporal logic for hybrid systems
- Decidable metric logics
This page was built for publication: On the decidability of continuous time specification formalisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221299)