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

Authors:
Nils Bulling;Berndt Farwer
Affiliations:
Department of Informatics, Clausthal University of Technology, Germany;School of Engineering and Computing Sciences, Durham University, UK
Venue:
CLIMA'09 Proceedings of the 10th international conference on Computational logic in multi-agent systems
Year:
2009

Citing 12
Cited 4

Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Linear logic

Theoretical Computer Science
Decidability of a temporal logic problem for petri nets

IDTC Second international conference on Database theory
"Sometimes" and "not never" revisited: on branching versus linear time (preliminary report)

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Alternating-time temporal logic

Journal of the ACM (JACM)
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
Verifying time, memory and communication bounds in systems of reasoning agents

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Theoretical and experimental results on the goal-plan tree problem

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
A Logic of Strategic Ability Under Bounded Memory

Journal of Logic, Language and Information
Parallel program schemata

Journal of Computer and System Sciences
Resource-bounded alternating-time temporal logic

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
On the (Un-)Decidability of Model Checking Resource-Bounded Agents

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence

On the (Un-)Decidability of Model Checking Resource-Bounded Agents

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Where logic and agents meet

Annals of Mathematics and Artificial Intelligence
On a Logic for Coalitional Games with Priced-Resource Agents

Electronic Notes in Theoretical Computer Science (ENTCS)
Comparing variants of strategic ability: how uncertainty and memory influence general properties of games

Autonomous Agents and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

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.