Verification of opacity and diagnosability for pushdown systems
From MaRDI portal
Publication:2375627
DOI10.1155/2013/654059zbMath1266.93096OpenAlexW1992896862WikidataQ59003587 ScholiaQ59003587MaRDI QIDQ2375627
Koichi Kobayashi, Kunihiko Hiraishi
Publication date: 14 June 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/654059
Related Items (3)
A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers ⋮ Opacity of networked discrete event systems ⋮ Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synthesis of opaque systems with static and dynamic masks
- Rewriting of visibly pushdown languages for XML data integration
- Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems
- Concurrent secrets
- Introduction to Discrete Event Systems
- Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)
- Superdeterministic PDAs
- Diagnosability of discrete-event systems
- A Note on the Properties of the Supremal Controllable Sublanguage in Pushdown Systems
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Optimal sensor selection for discrete-event systems with partial observation
- NP-completeness of sensor selection problems arising in partially observed discrete-event systems
- Verification of Infinite-Step Opacity and Complexity Considerations
- A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets
- Automata, Languages and Programming
This page was built for publication: Verification of opacity and diagnosability for pushdown systems
