License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TIME.2021.12
URN: urn:nbn:de:0030-drops-147880
Go to the corresponding LIPIcs Volume Portal

Bruse, Florian ; Lange, Martin

Model Checking Timed Recursive CTL

LIPIcs-TIME-2021-12.pdf (0.7 MB)


We introduce Timed Recursive CTL, a merger of two extensions of the well-known branching-time logic CTL: Timed CTL is interpreted over real-time systems like timed automata; Recursive CTL introduces a powerful recursion operator which takes the expressiveness of this logic CTL well beyond that of regular properties. The result is an expressive logic for real-time properties. We show that its model checking problem is decidable over timed automata, namely 2-EXPTIME-complete.

BibTeX - Entry

  author =	{Bruse, Florian and Lange, Martin},
  title =	{{Model Checking Timed Recursive CTL}},
  booktitle =	{28th International Symposium on Temporal Representation and Reasoning (TIME 2021)},
  pages =	{12:1--12:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-206-8},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{206},
  editor =	{Combi, Carlo and Eder, Johann and Reynolds, Mark},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-147880},
  doi =		{10.4230/LIPIcs.TIME.2021.12},
  annote =	{Keywords: formal specification, temporal logic, real-time systems}

Keywords: formal specification, temporal logic, real-time systems
Collection: 28th International Symposium on Temporal Representation and Reasoning (TIME 2021)
Issue Date: 2021
Date of publication: 16.09.2021

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