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

Berndt Muller, N. Bulling

Allbwn ymchwil: Pennod mewn Llyfr/Adroddiad/Trafodion CynhadleddCyfraniad i gynhadleddadolygiad gan gymheiriaid

Crynodeb

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.
Iaith wreiddiolSaesneg
TeitlN/A
Tudalennau22-45
Cyfrol6214
Dynodwyr Gwrthrych Digidol (DOIs)
StatwsCyhoeddwyd - 10 Medi 2010
Digwyddiad Computational Logic in Multi-Agent Systems. Post-Proceedings of CLIMA X - Hamberg Germany
Hyd: 9 Medi 201010 Medi 2010

Cynhadledd

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

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'Expressing properties of resource-bounded systems: the Logics RTL* and RTL'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn