Module Checking for Uncertain Agents

Abstract

Module checking is a decision problem proposed in late 1990s to formalize verification of open systems, i.e., systems that must adapt their behavior to the input they receive from the environment. It was recently shown that module checking offers a distinctly different perspective from the better-known problem of model checking. Module checking has been studied in several variants. Syntactically, specifications in temporal logic CTL and strategic logic ATL have been used. Semantically, the environment was assumed to have either perfect or imperfect information about the global state of the interaction. In this work, we rectify our approach to imperfect information module checking from the previous paper. Moreover, we study the variant of module checking where also the system acts under uncertainty. More precisely, we assume that the system consists of one or more agents whose decision making is constrained by their observational capabilities. We propose an automata-based verification procedure for the new problem, and establish its computational complexity.