Verifying systems of resource-bounded agents
From MaRDI portal
Recommendations
Cites work
- 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
- Expressing properties of resource-bounded systems: the logics RTL\(^{*}\) and RTL
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- Logic for coalitions with bounded resources
- On a logic for coalitional games with priced-resource agents
- On the (un-)decidability of model checking resource-bounded agents
- The cognitive agents specification language and verification environment
- The virtues of idleness: a decidable fragment of resource agent logic
Cited in
(13)- Exploring the future with resource-bounded agents
- Verifying time, memory and communication bounds in systems of reasoning agents
- Systems of agents controlled by logical programs: complexity of verification
- Formalization of semantics of systems with unreliable agents by means of nets of active resources
- Model checking and strategy synthesis for multi-agent systems for resource allocation
- The computational complexity of scenario-based agent verification and design
- Verification of multiple agent knowledge-based systems
- On the (un-)decidability of model checking resource-bounded agents
- Assurance of agent systems: what role should formal verification play?
- Methods for agent synchronization behaviour in system verification in terms of multi-agent environments
- scientific article; zbMATH DE number 1931645 (Why is no real title available?)
- State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems
- Compositional verification of a multi-agent system for one-to-many negotiation
This page was built for publication: Verifying systems of resource-bounded agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188235)
