License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2015.2
URN: urn:nbn:de:0030-drops-54465
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5446/
Go to the corresponding LIPIcs Volume Portal

Carapelle, Claudia ; Lohrey, Markus

Temporal Logics with Local Constraints (Invited Talk)

pdf-format:
42.pdf (0.5 MB)

Abstract

Recent decidability results on the satisfiability problem for temporal logics, in particular LTL, CTL* and ECTL*, with constraints over external structures like the integers with the order or infinite trees are surveyed in this paper.

BibTeX - Entry

@InProceedings{carapelle_et_al:LIPIcs:2015:5446,
  author =	{Claudia Carapelle and Markus Lohrey},
  title =	{{Temporal Logics with Local Constraints (Invited Talk)}},
  booktitle =	{24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
  pages =	{2--13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-90-3},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{41},
  editor =	{Stephan Kreutzer},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5446},
  URN =		{urn:nbn:de:0030-drops-54465},
  doi =		{10.4230/LIPIcs.CSL.2015.2},
  annote =	{Keywords: Temporal logics with constraints, concrete domains, LTL, CTL*, ECTL*}
}

Keywords: Temporal logics with constraints, concrete domains, LTL, CTL*, ECTL*
Collection: 24th EACSL Annual Conference on Computer Science Logic (CSL 2015)
Issue Date: 2015
Date of publication: 07.09.2015

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI