On feasible cases of checking multi-agent systems behavior.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 1202873 (Why is no real title available?)
- scientific article; zbMATH DE number 1059247 (Why is no real title available?)
- scientific article; zbMATH DE number 1142320 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 1522996 (Why is no real title available?)
- scientific article; zbMATH DE number 1759734 (Why is no real title available?)
- scientific article; zbMATH DE number 1820675 (Why is no real title available?)
- An automata-theoretic approach to branching-time model checking
- Clausal temporal resolution
- Fairness and related properties in transition systems - a temporal logic to deal with fairness
- MetateM: An introduction
- On complexity of verification of interacting agents' behavior
- The complexity of propositional linear temporal logics
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
- scientific article; zbMATH DE number 1931654 (Why is no real title available?)
- Systems of agents controlled by logical programs: complexity of verification
- scientific article; zbMATH DE number 2063027 (Why is no real title available?)
- 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)