Satisfiability of ECTL* with tree constraints
From International Center for Computational Logic
Satisfiability of ECTL* with tree constraints
Claudia CarapelleClaudia Carapelle, Shiguang FengShiguang Feng, Alexander KartzowAlexander Kartzow, Markus LohreyMarkus Lohrey
Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey
Satisfiability of ECTL* with tree constraints
In D. Lev Beklemishev, V. Daniil Musatov, eds., Proceedings of Computer Science -- Theory and Applications: 10th International Computer Science Symposium in Russia (CSR 2015), 94 - 108, 2015. Springer International Publishing
Satisfiability of ECTL* with tree constraints
In D. Lev Beklemishev, V. Daniil Musatov, eds., Proceedings of Computer Science -- Theory and Applications: 10th International Computer Science Symposium in Russia (CSR 2015), 94 - 108, 2015. Springer International Publishing
- Projekt:Project: QuantLA
- Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@Inbook{Carapelle2015,
author="Carapelle, Claudia
and Feng, Shiguang
and Kartzow, Alexander
and Lohrey, Markus",
editor="Beklemishev, D. Lev
and Musatov, V. Daniil",
chapter="Satisfiability of ECTL* with Tree Constraints",
title="Computer Science -- Theory and Applications: 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings",
year="2015",
publisher="Springer International Publishing",
address="Cham",
pages="94--108",
isbn="978-3-319-20297-6",
doi="10.1007/978-3-319-20297-6_7",
url="http://dx.doi.org/10.1007/978-3-319-20297-6_7"
}
