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.
|Title of host publication||N/A|
|Publication status||Published - 10 Sep 2010|
|Event|| Computational Logic in Multi-Agent Systems. Post-Proceedings of CLIMA X - Hamberg Germany|
Duration: 9 Sep 2010 → 10 Sep 2010
|Conference||Computational Logic in Multi-Agent Systems. Post-Proceedings of CLIMA X|
|Period||9/09/10 → 10/09/10|