Mimicking Behaviors in Separated Domains (Abstract Reprint)

Devising a strategy to make a system mimic behaviors from another system is a problem that naturally arises in many areas of Computer Science. In this work, we interpret this problem in the context of intelligent agents, from the perspective of ltl f , a formalism commonly used in AI for expressing finite-trace properties. Our model consists of two separated dynamic domains, D A and D B , and an ltl f specification that formalizes the notion of mimicking by mapping properties on behaviors (traces) of D A into properties on behaviors of D B . The goal is to synthesize a strategy that step-by-step maps every behavior of D A into a behavior of D B so that the specification is met. We consider several forms of mapping specifications, ranging from simple ones to full ltl f , and for each, we study synthesis algorithms and computational properties.