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 pus...
Saved in:
| Main Authors: | Koichi Kobayashi, Kunihiko Hiraishi |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2013/654059 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Computational Techniques for Model Predictive Control of Large-Scale Systems with Continuous-Valued and Discrete-Valued Inputs
by: Koichi Kobayashi, et al.
Published: (2013-01-01) -
A New Algorithm for the Determinisation of Visibly Pushdown Automata
by: Radomír Polách, et al.
Published: (2015-10-01) -
Opacity Verification for a Class of Modular Discrete Event Systems
by: Jingkai Yang, et al.
Published: (2025-01-01) -
Study on Progressive Collapse Behavior of SRC Column-Steel Beam Hybrid Frame Based on Pushdown Analysis
by: Liusheng Chu, et al.
Published: (2017-01-01) -
Verification of Opacity Under a <i>K</i>-Delay Orwellian Observation Mechanism
by: Jiahui Zhang, et al.
Published: (2025-05-01)