A Sat-Based Approach to Unbounded Model Checking for Alternating-Time Temporal Epistemic Logic

Synthese 142 (2):203-227 (2004)
  Copy   BIBTEX

Abstract

This paper deals with the problem of verification of game-like structures by means of symbolic model checking. Alternating-time Temporal Epistemic Logic (ATEL) is used for expressing properties of multi-agent systems represented by alternating epistemic temporal systems as well as concurrent epistemic game structures. Unbounded model checking (a SAT based technique) is applied for the first time to verification of ATEL. An example is given to show an application of the technique.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Alternating automata and temporal logic normal forms.Clare Dixon, Alexander Bolotov & Michael Fisher - 2005 - Annals of Pure and Applied Logic 135 (1-3):263-285.
A decidable timeout-based extension of linear temporal logic.Janardan Misra & Suman Roy - 2014 - Journal of Applied Non-Classical Logics 24 (3):262-291.
Linear, branching time and joint closure semantics for temporal logic.Joeri Engelfriet & Jan Treur - 2002 - Journal of Logic, Language and Information 11 (4):389-425.
Model checking for hybrid logic.Martin Lange - 2009 - Journal of Logic, Language and Information 18 (4):465-491.

Analytics

Added to PP
2009-01-28

Downloads
43 (#361,277)

6 months
5 (#629,136)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Add more citations