Open Access
Translator Disclaimer
2013 Verification of Opacity and Diagnosability for Pushdown Systems
Koichi Kobayashi, Kunihiko Hiraishi
J. Appl. Math. 2013(SI10): 1-10 (2013). DOI: 10.1155/2013/654059

Abstract

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.

Citation

Download Citation

Koichi Kobayashi. Kunihiko Hiraishi. "Verification of Opacity and Diagnosability for Pushdown Systems." J. Appl. Math. 2013 (SI10) 1 - 10, 2013. https://doi.org/10.1155/2013/654059

Information

Published: 2013
First available in Project Euclid: 9 May 2014

zbMATH: 1266.93096
Digital Object Identifier: 10.1155/2013/654059

Rights: Copyright © 2013 Hindawi

JOURNAL ARTICLE
10 PAGES


SHARE
Vol.2013 • No. SI10 • 2013
Back to Top