pith. sign in

arxiv: 1802.03321 · v2 · pith:YP6T46AAnew · submitted 2018-02-09 · 💻 cs.LO · math.OC

Opacity of nondeterministic transition systems: A (bi)simulation relation approach

classification 💻 cs.LO math.OC
keywords opacitynondeterministicsystemstransitioninfinitenftsopacity-preservingrelation
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.