Assessment of initial-state-opacity in live and bounded labeled Petri net systems via optimization techniques
From MaRDI portal
Publication:6160740
DOI10.1016/J.AUTOMATICA.2023.110911zbMATH Open1519.93140OpenAlexW4323688049MaRDI QIDQ6160740FDOQ6160740
Authors: Francesco Basile, G. De Tommasi, Carlo Motta 
Publication date: 26 June 2023
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2023.110911
Recommendations
- Optimization-based assessment of initial-state opacity in Petri nets
- Verification of \(K\)-step and infinite-step opacity of bounded labeled Petri nets
- On-line verification of current-state opacity by Petri nets and integer linear programming
- Current-state opacity modelling and verification in partially observed Petri nets
- Decidability of opacity verification problems in labeled Petri net systems
Cites Work
- On \(\mathcal K\)-diagnosability of Petri nets via integer linear programming
- Title not available (Why is that?)
- Fault detection for discrete event systems using Petri nets with unobservable transitions
- Comparative analysis of related notions of opacity in centralized and coordinated architectures
- The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
- Multilevel transitive and intransitive non-interference, causally
- Estimation and inference in discrete event systems. A model-based approach with finite automata
- Structural analysis of Petri nets
- Verification of State-Based Opacity Using Petri Nets
- Graph Theoretic Bound on Number of A.C.I.M. for Random Transformation
- Lectures on Concurrency and Petri Nets
- On-line verification of current-state opacity by Petri nets and integer linear programming
- Current-state opacity modelling and verification in partially observed Petri nets
- Verification and enforcement of strong infinite- and \(k\)-step opacity using state recognizers
- Introduction to Discrete Event Systems
- Optimization-based assessment of initial-state opacity in Petri nets
- Noninterference Enforcement via Supervisory Control in Bounded Petri Nets
- An optimization-based approach to assess non-interference in labeled and bounded Petri net systems
- Verification of \(K\)-step and infinite-step opacity of bounded labeled Petri nets
- Introduction to Petri nets
Cited In (6)
- An optimization-based approach to assess non-interference in labeled and bounded Petri net systems
- On-line verification of current-state opacity by Petri nets and integer linear programming
- Fault-prognosability, \(K\)-step prognosis and \(K\)-step predictive diagnosis in partially observed Petri nets by means of algebraic techniques
- Decidability of opacity verification problems in labeled Petri net systems
- Corrigendum to: ``Assessment of initial-state-opacity in live and bounded labeled Petri net systems via optimization techniques
- Optimization-based assessment of initial-state opacity in Petri nets
This page was built for publication: Assessment of initial-state-opacity in live and bounded labeled Petri net systems via optimization techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160740)
