On feasible cases of checking multi-agent systems behavior.
From MaRDI portal
Publication:1401355
DOI10.1016/S0304-3975(02)00445-0zbMATH Open1044.68144OpenAlexW2023051844MaRDI QIDQ1401355FDOQ1401355
Authors: Alexandre Dikovsky, Michael I. Dekhtyar, M. K. Valiev 
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00445-0
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of propositional linear temporal logics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Clausal temporal resolution
- Fairness and related properties in transition systems - a temporal logic to deal with fairness
- MetateM: An introduction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An automata-theoretic approach to branching-time model checking
- On complexity of verification of interacting agents' behavior
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- On complexity of verification of interacting agents' behavior
- Artificial Intelligence: Methodology, Systems, and Applications
- Abstract State Machines 2004. Advances in Theory and Practice
- Title not available (Why is that?)
- Systems of agents controlled by logical programs: complexity of verification
- Title not available (Why is that?)
- Biography of Alexandre Dikovsky
This page was built for publication: On feasible cases of checking multi-agent systems behavior.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401355)
