Opacity of nondeterministic transition systems: A (bi)simulation relation approach
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose several opacity-preserving (bi)simulation relations for general nondeterministic transition systems (NTS) in terms of initial-state opacity, current-state opacity, K-step opacity, and infinite-step opacity. We also show how one can leverage quotient construction to compute such relations. In addition, we use a two-way observer method to verify opacity of nondeterministic finite transition systems (NFTSs). As a result, although the verification of opacity for infinite NTSs is generally undecidable, if one can find such an opacity-preserving relation from an infinite NTS to an NFTS, the (lack of) opacity of the NTS can be easily verified over the NFTS which is decidable.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Feb 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.
- 2024Hyper Strategy Logiccited by 1
- 2025Decentralized Planning Using Probabilistic Hyperpropertiescited by 0
- 2025Decentralized Planning Using Probabilistic Hyperproperties19 Feb 2025
- 2024Hyper Strategy Logic20 Mar 2024