DeepAI AI Chat
Log In Sign Up

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

by   Kuize Zhang, et al.

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.


page 1

page 2

page 3

page 4


Bisimulation as a Logical Relation

We investigate how various forms of bisimulation can be characterised us...

Trace semantics via determinization for probabilistic transition systems

A coalgebraic definition of finite and infinite trace semantics for prob...

K-Step Opacity in Discrete Event Systems: Verification, Complexity, and Relations

Opacity is a property expressing whether a system may reveal its secret ...

Construction of a bi-infinite power free word with a given factor and a non-recurrent letter

Let L_k,α^ℤ denote the set of all bi-infinite α-power free words over an...

Biochemical Space Language in Relation to Multiset Rewriting Systems

This technical report relates Biochemical Space Language (BCSL) to Multi...

A Lean-Congruence Format for EP-Bisimilarity

Enabling preserving bisimilarity is a refinement of strong bisimilarity,...

Stone Duality for Relations

We show how Stone duality can be extended from maps to relations. This i...