Expressing properties of resource-bounded systems: the Logics RTL* and RTL

Berndt Muller, N. Bulling

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Computation systems and logics for modelling such systems have been studied to a great extent in the past decades. This paper introduces resources into the models of systems and discusses the Resource-Bounded Tree Logics RTL and RTL*, based on the well-known Computation Tree Logics CTL and CTL*, for reasoning about computations of such systems. We present initial results on the complexity/decidability of model checking.
Original languageEnglish
Title of host publicationN/A
Pages22-45
Volume6214
DOIs
Publication statusPublished - 10 Sept 2010
Event Computational Logic in Multi-Agent Systems. Post-Proceedings of CLIMA X - Hamberg Germany
Duration: 9 Sept 201010 Sept 2010

Conference

Conference Computational Logic in Multi-Agent Systems. Post-Proceedings of CLIMA X
Period9/09/1010/09/10

Keywords

  • resources
  • logics
  • ctl
  • verification

Fingerprint

Dive into the research topics of 'Expressing properties of resource-bounded systems: the Logics RTL* and RTL'. Together they form a unique fingerprint.

Cite this