Access Restriction

Author Lomuscio, Alessio ♦ Raimondi, Franco
Source CiteSeerX
Content type Text
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Multi-agent System ♦ Model Checker ♦ Temporal-epistemic Formula ♦ Ctlk Specification ♦ Concurrent Program ♦ Complexity Result
Description ACM, 2006. Checking Knowledge and Linear Time: PSPACE Cases 17
This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying programs by means of two model checkers for multi-agent systems: MCMAS and Verics.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 2006-01-01