Opacity of Nondeterministic Transition Systems: A (Bi)Simulation Relation Approach

DOI10.1109/TAC.2019.2908726zbMath1482.93403arXiv1802.03321OpenAlexW2963995273WikidataQ128124262 ScholiaQ128124262MaRDI QIDQ5211280

Kuize Zhang, Xiang Yin, Majid Zamani

Publication date: 28 January 2020

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.03321

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (10)

Enforcement for infinite-step opacity and K-step opacity via insertion mechanism ⋮ Authors' reply to ``Comments on: ``A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers' ⋮ Initial-state detectability and initial-state opacity of unambiguous weighted automata ⋮ Compositional synthesis of opacity-preserving finite abstractions for interconnected systems ⋮ Strong current-state and initial-state opacity of discrete-event systems ⋮ Matrix approach for verification of opacity of partially observed discrete event systems ⋮ Non-interference assessment in colored net systems via integer linear programming ⋮ Enforcing opacity by insertion functions under multiple energy constraints ⋮ Verification of approximate opacity for switched systems: a compositional approach ⋮ Enforcing current-state opacity through shuffle and deletions of event observations

This page was built for publication: Opacity of Nondeterministic Transition Systems: A (Bi)Simulation Relation Approach