Checking interval properties of computations
From MaRDI portal
Publication:329413
DOI10.1007/s00236-015-0250-1zbMath1350.68184arXiv1601.03195OpenAlexW2952938415MaRDI QIDQ329413
Giuseppe Perelli, Angelo Montanari, Aniello Murano, Adriano Peron, Alberto Molinari
Publication date: 21 October 2016
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.03195
Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)
Related Items (19)
Complexity analysis of a unifying algorithm for model checking interval temporal logic ⋮ Checking interval properties of computations ⋮ A separation theorem for discrete-time interval temporal logic ⋮ Model checking interval temporal logics with regular expressions ⋮ \textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes ⋮ Interval Temporal Logic for Visibly Pushdown Systems ⋮ Allen-like theory of time for tree-like structures ⋮ Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Interval vs. Point Temporal Logic Model Checking ⋮ Unnamed Item ⋮ Which fragments of the interval temporal logic HS are tractable in model checking? ⋮ Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals ⋮ Unnamed Item ⋮ Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy ⋮ Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments ⋮ On a Temporal Logic of Prefixes and Infixes. ⋮ On coarser interval temporal logics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Checking interval properties of computations
- Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions
- The temporal semantics of concurrent programs
- Intervals and tenses
- The dark side of interval temporal logic: marking the undecidability border
- Model checking propositional dynamic logic with all extras
- Tableaux for Logics of Subinterval Structures over Dense Orderings
- SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR
- Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals
- The complexity of propositional linear temporal logics
- A Modal Logic for Chopping Intervals
- A propositional modal logic of time intervals
- The Undecidability of the Logic of Subintervals
- A Road Map of Interval Temporal Logics and Duration Calculi
This page was built for publication: Checking interval properties of computations