State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems

DOI10.1007/978-3-030-48006-6_2MaRDI QIDQ5049036zbMATH OpenOpenAlexFDO

Authors Natasha Alechina, Brian Logan

Publication date 9 November 2022

Published in Fields of Logic and Computation III (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-48006-6_2

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Recommendations

• Verifying systems of resource-bounded agents
• On the (un-)decidability of model checking resource-bounded agents
• Specification and Verification of Multi-Agent Systems
• Model checking coalitional games in shortage resource scenarios
• On complexity of verification of interacting agents' behavior

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• Alternating vector addition systems with states
• Alternating-time temporal logic
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Decidable model-checking for a resource logic with production of resources
• Decision problems for propositional linear logic
• Expressing properties of resource-bounded systems: the logics RTL\(^{*}\) and RTL
• Fixed-dimensional energy games are in pseudo-polynomial time
• Games for counting abstractions
• Generalized mean-payoff and energy games
• How to be both rich and happy: combining quantitative and qualitative strategic reasoning about multi-player games (extended abstract)
• Logic for coalitions with bounded resources
• Model checking coalitional games in shortage resource scenarios
• Model-checking for resource-bounded ATL with production and consumption of resources
• On a logic for coalitional games with priced-resource agents
• On the (un-)decidability of model checking resource-bounded agents
• On the complexity of resource-bounded logics
• Petri nets, Horn programs, linear logic and vector games
• Reachability games on extended vector addition systems with states
• Solving parity games on integer vectors
• The virtues of idleness: a decidable fragment of resource agent logic
• Verifying systems of resource-bounded agents

Cited in

(6)

• Parameterised verification for multi-agent systems
• Verifying time, memory and communication bounds in systems of reasoning agents
• Formalization of semantics of systems with unreliable agents by means of nets of active resources
• Systems of agents controlled by logical programs: complexity of verification
• Strategic reasoning with a bounded number of resources: the quest for tractability
• Practical verification of multi-agent systems against \textsc{Slk} specifications

Describes a project that uses

Uses Software

• MOCHA
• MCMAS
• PRISM

This page was built for publication: State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems

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