DSpace Welsh Repository Network Partner WRN Partners

University of South Wales DSpace >
University of South Wales >
Advanced Technology >
Computer Science >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10265/516

Title: Expressing properties of resource-bounded systems: the Logics RTL* and RTL
Authors: Muller, Berndt
Issue Date: 2-May-2012
Citation: Bulling, L. and Farwe, B. (2010) 'Expressing properties of resource-bounded systems: the Logics RTL* and RTL', in Dix, J., Fisher, M. and Novák, P. (eds.) Computational Logic in Multi-Agent Systems, 10th International Workshop, CLIMA X, Hamburg, Germany, 9-10 September, 2009, Revised Selected and Invited Papers, Lecture Notes in Computer Science, 6214/2010, pp: 22-45.
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.
URI: http://hdl.handle.net/10265/516
ISSN: 0302-9743
Appears in Collections:Computer Science

Files in This Item:

There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback