Version vom 23. März 2016, 11:27 Uhr

Satisfiability of ECTL* with Constraints

Claudia CarapelleClaudia Carapelle, Alexander KartzowAlexander Kartzow, Markus LohreyMarkus Lohrey

DOI Link

Claudia Carapelle, Alexander Kartzow, Markus Lohrey
Satisfiability of ECTL* with Constraints
Journal of Computer and System Sciences, to appear

Details
Bibtex

KurzfassungAbstract
We show that satisfiability and finite satisfiability for ECTL* with equality-, order-, and modulo-constraints over the integers are decidable. Since ECTL* is a proper extension of CTL* this greatly improves the previously known decidability results for certain fragments of CTL*, e.g., the existential and positive fragments and EF. We also show that our choice of local constraints is necessary for the result in the sense that, if we add the possibility to state non-local constraints over the integers, the resulting logic becomes undecidable.
Weitere Informationen unter:Further Information: Link
Projekt:Project: QuantLA
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@article{CKL2016,
  author  = {Claudia Carapelle and Alexander Kartzow and Markus Lohrey},
  title   = {Satisfiability of {ECTL*} with Constraints},
  journal = {Journal of Computer and System Sciences},
  year    = {2016},
  doi     = {10.1016/j.jcss.2016.02.002}
}

@@ Zeile 4: / Zeile 4: @@
 |FurtherAuthors=Alexander Kartzow; Markus Lohrey;
 }}
-{{Inproceedings
+{{Article
 |Referiert=1
-|Title=Satisfiability of CTL* with constraints
+|Title=Satisfiability of ECTL* with Constraints
-|To appear=0
+|To appear=1
-|Year=2013
+|Year=2016
-|Booktitle=Concurrency Theory: 24th International Conference, CONCUR 2013
+|Journal=Journal of Computer and System Sciences
-|Pages=455-469
-|Publisher=Springer
-|Series=LNCS
-|Volume=8052
 }}
 {{Publikation Details
-|Abstract=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.
+|Abstract=We show that satisfiability and finite satisfiability for ECTL* with equality-, order-, and modulo-constraints over the integers are decidable. Since ECTL* is a proper extension of CTL* this greatly improves the previously known decidability results for certain fragments of CTL*, e.g., the existential and positive fragments and EF. We also show that our choice of local constraints is necessary for the result in the sense that, if we add the possibility to state non-local constraints over the integers, the resulting logic becomes undecidable.
-|Link=http://dx.doi.org/10.1007/978-3-642-40184-8_32
+|Link=http://authors.elsevier.com/sd/article/S002200001600012X
-|DOI Name=10.1007/978-3-642-40184-8_32
+|DOI Name=10.1016/j.jcss.2016.02.002
 |Projekt=QuantLA
 |Forschungsgruppe=Automatentheorie
-|BibTex=@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"
-}
 }}
-{{Article
+{{Inproceedings
-|Referiert=0
+|Referiert=1
-|Title=Satisfiability of ECTL* with Constraints
+|Title=Satisfiability of ECTL* with constraints
-|To appear=1
+|To appear=0
 |Year=2016
-|Journal=Journal of Computer and System Sciences
 }}

ArticleJCSS16: Unterschied zwischen den Versionen

Version vom 23. März 2016, 11:27 Uhr

Satisfiability of ECTL* with Constraints

Claudia CarapelleClaudia Carapelle, Alexander KartzowAlexander Kartzow, Markus LohreyMarkus Lohrey