Verification of opacity and diagnosability for pushdown systems

In control theory of discrete event systems (dess),one of the challenging topics is the extension of theory of finite-state dess to that of infinite-state dess. in this paper,we discuss verification of opacity and diagnosability for infinite-state dess modeled by pushdown automata (called here pushdown systems). first,we discuss opacity of pushdown systems and prove that opacity of pushdown systems is in general undecidable. in addition,a decidable class is clarified. next,in diagnosability,we prove that under a certain assumption,which is different from the assumption in the existing result,diagnosability of pushdown systems is decidable. furthermore,a necessary condition and a sufficient condition using finite-state approximations are derived. finally,as one of the applications,we consider data integration using xml (extensible markup language). the obtained result is useful for developing control theory of infinite-state dess. © 2013 koichi kobayashi and kunihiko hiraishi.