???jsp.layout.header-default.alt??? ???jsp.wrn.button.text??? ???jsp.wrn.button.alt???
  
 

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

???jsp.display-item.identifier??? http://hdl.handle.net/10265/516

???metadata.dc.title???: Expressing properties of resource-bounded systems: the Logics RTL* and RTL
???metadata.dc.contributor.*???: Muller, Berndt
???metadata.dc.date.issued???: 2-May-2012
???metadata.dc.identifier.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.
???metadata.dc.description.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.
???metadata.dc.identifier.uri???: http://hdl.handle.net/10265/516
???metadata.dc.identifier.issn???: 0302-9743
???org.dspace.app.webui.jsptag.ItemTag.appears???Computer Science

???org.dspace.app.webui.jsptag.ItemTag.files???

???org.dspace.app.webui.jsptag.ItemTag.files.no???



???jsp.display-item.copyright???

 

Valid XHTML 1.0! ???jsp.layout.footer-default.text??? - ???jsp.layout.footer-default.feedback???