Satisfiability of CTL* with Constraints

DOI10.1007/978-3-642-40184-8_32zbMath1391.03017arXiv1306.0814OpenAlexW2568457281MaRDI QIDQ2842126

Alexander Kartzow, Claudia Carapelle, Markus Lohrey

Publication date: 12 August 2013

Published in: CONCUR 2013 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.0814

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Related Items (4)

Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints ⋮ Satisfiability of ECTL* with Tree Constraints ⋮ Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints ⋮ Church synthesis on register automata over linearly ordered data domains

This page was built for publication: Satisfiability of CTL* with Constraints