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

Berndt Muller; N. Bulling

doi:10.1007/978-3-642-16867-3_2

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

Berndt Muller, N. Bulling

Faculty of Computing, Engineering and Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	N/A
Pages	22-45
Volume	6214
DOIs	https://doi.org/10.1007/978-3-642-16867-3_2
Publication status	Published - 10 Sept 2010
Event	Computational Logic in Multi-Agent Systems. Post-Proceedings of CLIMA X - Hamberg Germany Duration: 9 Sept 2010 → 10 Sept 2010

Conference

Conference	Computational Logic in Multi-Agent Systems. Post-Proceedings of CLIMA X
Period	9/09/10 → 10/09/10

Keywords

resources
logics
ctl
verification

Access to Document

10.1007/978-3-642-16867-3_2

Cite this

@inproceedings{13adece896974be293227949ab726159,

title = "Expressing properties of resource-bounded systems: the Logics RTL* and RTL",

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.",

keywords = "resources, logics, ctl, verification",

author = "Berndt Muller and N. Bulling",

note = "notValidatingIssn:03029743; Computational Logic in Multi-Agent Systems. Post-Proceedings of CLIMA X ; Conference date: 09-09-2010 Through 10-09-2010",

year = "2010",

month = sep,

day = "10",

doi = "10.1007/978-3-642-16867-3_2",

language = "English",

volume = "6214",

pages = "22--45",

booktitle = "N/A",

}

TY - GEN

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

AU - Muller, Berndt

AU - Bulling, N.

N1 - notValidatingIssn:03029743

PY - 2010/9/10

Y1 - 2010/9/10

N2 - 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.

AB - 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.

KW - resources

KW - logics

KW - ctl

KW - verification

U2 - 10.1007/978-3-642-16867-3_2

DO - 10.1007/978-3-642-16867-3_2

M3 - Conference contribution

VL - 6214

SP - 22

EP - 45

BT - N/A

T2 - Computational Logic in Multi-Agent Systems. Post-Proceedings of CLIMA X

Y2 - 9 September 2010 through 10 September 2010

ER -

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

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this