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. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Bulling, N., & Farwer, B. (2010). Expressing properties of resource-bounded systems: The logics RTL* and RTL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6214 LNAI, pp. 22–45). https://doi.org/10.1007/978-3-642-16867-3_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
