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

DOI10.1007/978-3-642-16867-3_2MaRDI QIDQ3055669zbMATH OpenOpenAlexFDO

Authors Nils Bulling, Berndt Farwer

Publication date 9 November 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-16867-3_2

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• On the complexity of resource-bounded logics
• On the complexity of resource-bounded logics
• scientific article; zbMATH DE number 7368413
• Logic for coalitions with bounded resources
• Model-checking for resource-bounded ATL with production and consumption of resources

Cited in

(12)

• Characterization, verification and generation of strategies in games with resource constraints
• Strategic reasoning with a bounded number of resources: the quest for tractability
• Natural strategic ability
• On a logic for coalitional games with priced-resource agents
• Information flow under budget constraints
• Verifying systems of resource-bounded agents
• State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems
• The virtues of idleness: a decidable fragment of resource agent logic
• On the complexity of resource-bounded logics
• Formal modelling and verification of probabilistic resource bounded agents
• Where logic and agents meet
• Knowing the price of success

This page was built for publication: Expressing properties of resource-bounded systems: the logics RTL\(^{*}\) and RTL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055669)