Comparative analysis of related notions of opacity in centralized and coordinated architectures

From MaRDI portal
Publication:373013

DOI10.1007/s10626-012-0145-zzbMath1272.93084OpenAlexW2037457229MaRDI QIDQ373013

Stéphane Lafortune, Yi-Chin Wu

Publication date: 21 October 2013

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-012-0145-z



Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (36)

An optimization-based approach to assess non-interference in labeled and bounded Petri net systemsEnforcement for infinite-step opacity and K-step opacity via insertion mechanismVerification of \(K\)-step and infinite-step opacity of bounded labeled Petri netsA framework for current-state opacity under dynamic information release mechanism\(k\)-memory-embedded insertion mechanism for opacity enforcementCurrent-state opacity and initial-state opacity of modular discrete event systemsDecidability of opacity verification problems in labeled Petri net systemsA new approach for the verification of infinite-step and \(K\)-step opacity using two-way observersInitial-state detectability and initial-state opacity of unambiguous weighted automataA general language-based framework for specifying and verifying notions of opacityVerification and enforcement of current-state opacity based on a state space approachStrong current-state and initial-state opacity of discrete-event systemsState-based opacity of labeled real-time automataGame current-state opacity formulation in probabilistic resource automataActive opacity of discrete-event systemsMatrix approach for verification of opacity of partially observed discrete event systemsAssessment of initial-state-opacity in live and bounded labeled Petri net systems via optimization techniquesInformation control in networked discrete event systems and its application to battery management systemsPrivacy and safety analysis of timed stochastic discrete event systems using Markovian trajectory-observersInfinite-step opacity and \(K\)-step opacity of stochastic discrete-event systemsSynthesis of insertion functions for enforcement of opacity security propertiesCurrent-state opacity modelling and verification in partially observed Petri netsVerification of C-detectability using Petri netsCurrent-state opacity enforcement in discrete event systems under incomparable observationsProbabilistic system opacity in discrete event systemsEnforcement of opacity by public and private insertion functionsOn-line verification of current-state opacity by Petri nets and integer linear programmingRelative predictability of failure event occurrences and its opacity-based test algorithmOpacity of networked discrete event systemsComparing the notions of opacity for discrete-event systemsEnforcing current-state opacity through shuffle and deletions of event observationsVerification and enforcement of strong infinite- and \(k\)-step opacity using state recognizersOnline verification of \(K\)-step opacity by Petri nets in centralized and decentralized structuresOptimization-based assessment of initial-state opacity in Petri netsUsing subobservers to synthesize opacity-enforcing supervisorsDiagnosis and opacity problems for infinite state systems modeled by recursive tile systems


Uses Software


Cites Work


This page was built for publication: Comparative analysis of related notions of opacity in centralized and coordinated architectures