A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
What can machines know?: On the properties of knowledge in distributed systems
Journal of the ACM (JACM)
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Knowledge, timed precedence and clocks (preliminary report)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Reasoning about knowledge
An efficient state space generation for analysis of real-time systems
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Applications of a logic of knowledge to motion planning under uncertainty
Journal of the ACM (JACM)
Symbolic model checking using SAT procedures instead of BDDs
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Model checking
Analysis of Timed Systems Using Time-Abstracting Bisimulations
Formal Methods in System Design
Modal logic
Bounded model checking for the universal fragment of CTL
Fundamenta Informaticae
Model Checking Knowledge and Time
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Bounded Model Checking for Timed Systems
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Towards Bounded Model Checking for the Universal Fragment of TCTL
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Time, Knowledge, and Cooperation: Alternating-Time Temporal Epistemic Logic and Its Applications
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Verifying epistemic properties of multi-agent systems via bounded model checking
Fundamenta Informaticae - Concurrency specification and programming
Complete Axiomatizations for Reasoning about Knowledge and Time
SIAM Journal on Computing
Symbolic Model Checking the Knowledge of the Dining Cryptographers
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Verification of Multiagent Systems via Unbounded Model Checking
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Improvements in SAT-based Reachability Analysis for Timed Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
ACTLS properties and Bounded Model Checking
Fundamenta Informaticae
Bounded Model Checking for Deontic Interpreted Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A logic for knowledge, correctness, and real time
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
Symbolic model checking for temporal-epistemic logics
ACM SIGACT News
A Complete Quantified Epistemic Logic for Reasoning about Message Passing Systems
Computational Logic in Multi-Agent Systems
VerICS 2007 - a Model Checker for Knowledge and Real-Time
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Symbolic model checking for temporal-epistemic logic
Logic Programs, Norms and Action
VerICS 2007 - a Model Checker for Knowledge and Real-Time
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Combined model checking for temporal, probabilistic, and real-time logics
Theoretical Computer Science
An epistemic Halpern-Shoham logic
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |
We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We show that the TECTLK model checking problem is decidable, and we present an algorithm for bounded model checking based on a discretisation method. We exemplify the use of the technique by means of the ''Railroad Crossing System'', a popular example in the multi-agent systems literature.