Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints
From MaRDI portal
Publication:5387893
DOI10.1007/11916277_14zbMath1165.03324OpenAlexW1865793903MaRDI QIDQ5387893
Publication date: 27 May 2008
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11916277_14
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (8)
Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints ⋮ Verification of Gap-Order Constraint Abstractions of Counter Systems ⋮ Satisfiability of ECTL* with Tree Constraints ⋮ An automata-theoretic approach to constraint LTL ⋮ Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints ⋮ Verification of gap-order constraint abstractions of counter systems ⋮ Verification of qualitative \(\mathbb Z\) constraints ⋮ CTL* model checking for data-aware dynamic systems with arithmetic
This page was built for publication: Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints
