Pages that link to "Item:Q329413"
From MaRDI portal
The following pages link to Checking interval properties of computations (Q329413):
Displaying 17 items.
- Checking interval properties of computations (Q329413) (← links)
- Complexity analysis of a unifying algorithm for model checking interval temporal logic (Q821561) (← links)
- Allen-like theory of time for tree-like structures (Q1706167) (← links)
- Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives (Q1706170) (← links)
- Which fragments of the interval temporal logic HS are tractable in model checking? (Q1731517) (← links)
- Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals (Q1740653) (← links)
- Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy (Q1784961) (← links)
- Model checking interval temporal logics with regular expressions (Q2182727) (← links)
- On coarser interval temporal logics (Q2321249) (← links)
- Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments (Q2817939) (← links)
- (Q3384161) (← links)
- Interval vs. Point Temporal Logic Model Checking (Q4617981) (← links)
- (Q5015270) (← links)
- A separation theorem for discrete-time interval temporal logic (Q5074367) (← links)
- (Q5079773) (← links)
- On a Temporal Logic of Prefixes and Infixes. (Q5089182) (← links)
- \textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes (Q6077844) (← links)