Satisfiability of CTL* with constraints

Claudia CarapelleClaudia Carapelle, Alexander KartzowAlexander Kartzow, Markus LohreyMarkus Lohrey

DOI Link

Claudia Carapelle, Alexander Kartzow, Markus Lohrey
Satisfiability of CTL* with constraints
Concurrency Theory: 24th International Conference, CONCUR 2013, volume 8052 of LNCS, 455-469, 2013. Springer

Details
Bibtex

KurzfassungAbstract
We show that satisfiability for CTL* with equality-, order-, and modulo-constraints over the integers is decidable. Previously, decidability was only known for certain fragments of CTL*, e.g., the existential and positive fragments and EF.
Weitere Informationen unter:Further Information: Link
Projekt:Project: QuantLA
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-40184-8_32.

@Inbook{Carapelle2013,
author="Carapelle, Claudia
and Kartzow, Alexander
and Lohrey, Markus",
editor="D'Argenio, Pedro R.
and Melgratti, Hern{\'a}n",
chapter="Satisfiability of CTL* with Constraints",
title="CONCUR 2013 -- Concurrency Theory: 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings",
year="2013",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="455--469",
isbn="978-3-642-40184-8",
doi="10.1007/978-3-642-40184-8_32",
url="http://dx.doi.org/10.1007/978-3-642-40184-8_32"
}