4.7 Article

Verifying weak and strong k-step opacity in discrete-event systems✩

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Automation & Control Systems

A general language-based framework for specifying and verifying notions of opacity

Andrew Wintenberg et al.

Summary: This paper provides a general framework of opacity to unify the existing notions of opacity for discrete event systems. It discusses language-based and state-based notions of opacity and presents verification methods. It also investigates the concept of K-step opacity and provides corresponding language-based verification methods.

DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS (2022)

Proceedings Paper Automation & Control Systems

On Verification of Weak and Strong k-Step Opacity for Discrete-Event Systems

Jiri Balun et al.

Summary: This paper investigates the opacity of a system and proposes a new algorithm to verify weak k-step opacity, as well as reducing the verification of strong k-step opacity to the verification of weak k-step opacity.

IFAC PAPERSONLINE (2022)

Article Automation & Control Systems

Verification and enforcement of strong infinite- and k-step opacity using state recognizers

Ziyue Ma et al.

Summary: This paper investigates the verification and enforcement problems of strong infinite-step opacity and k-step opacity for partially observed discrete-event systems, proposing two information structures and providing complexity analyses of the verification algorithms. Additionally, an upper bound for the value of k in strong k-step opacity is derived, along with a solution for determining the maximal value of k for a given plant. Enforcement of strong infinite- and k-step opacity can be addressed using supervisory control.

AUTOMATICA (2021)

Article Automation & Control Systems

Comparing the notions of opacity for discrete-event systems

Jiri Balun et al.

Summary: This study compares different notions of opacity, finding that they can be transformed into each other and have applications in complexity results. The transformations, computable in polynomial time, determine the complexity of verifying these notions. The algorithmic complexity is also improved to some extent.

DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS (2021)

Review Automation & Control Systems

Overview of discrete event systems opacity: Models, validation, and quantification

Romain Jacob et al.

ANNUAL REVIEWS IN CONTROL (2016)

Article Automation & Control Systems

Enforcement and validation (at runtime) of various notions of opacity

Ylies Falcone et al.

DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS (2015)

Article Automation & Control Systems

Verification of Infinite-Step Opacity and Complexity Considerations

Anooshiravan Saboori et al.

IEEE TRANSACTIONS ON AUTOMATIC CONTROL (2012)

Article Computer Science, Theory & Methods

On a structural property in the state complexity of projected regular languages

Galina Jiraskova et al.

THEORETICAL COMPUTER SCIENCE (2012)

Article Automation & Control Systems

Opacity of discrete event systems and its applications

Feng Lin

AUTOMATICA (2011)

Article Automation & Control Systems

Verification of K-Step Opacity and Analysis of Its Complexity

Anooshiravan Saboori et al.

IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING (2011)

Article Computer Science, Information Systems

Opacity generalised to transition systems

Jeremy W. Bryans et al.

INTERNATIONAL JOURNAL OF INFORMATION SECURITY (2008)

Article Automation & Control Systems

Concurrent secrets

E. Badouel et al.

DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS (2007)

Article Computer Science, Theory & Methods

Modelling Opacity Using Petri Nets

Jeremy W. Bryans et al.

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE (2005)