ArticleJCSS16

PublikationenPublications

• Nach AutorBy Author
  • Claudia CarapelleClaudia Carapelle
• Nach ForschungsgruppeBy Research Group
  • AutomatentheorieAutomata Theory

Toggle side column

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}
}