Assessment of initial-state-opacity in live and bounded labeled Petri net systems via optimization techniques

DOI10.1016/j.automatica.2023.110911zbMath1519.93140OpenAlexW4323688049MaRDI QIDQ6160740

Gianmaria De Tommasi, Carlo Motta, Francesco Basile

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

zbMATH Keywords

integer linear programmingopacitylabeled Petri netsdes

Mathematics Subject Classification ID

Integer programming (90C10) Discrete event control/observation systems (93C65)

Cites Work

• Unnamed Item
• Comparative analysis of related notions of opacity in centralized and coordinated architectures
• Fault detection for discrete event systems using Petri nets with unobservable transitions
• Multilevel transitive and intransitive non-interference, causally
• On-line verification of current-state opacity by Petri nets and integer linear programming
• On \(\mathcal K\)-diagnosability of Petri nets via 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
• Optimization-based assessment of initial-state opacity in 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
• Graph Theoretic Bound on Number of A.C.I.M. for Random Transformation
• The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
• Noninterference Enforcement via Supervisory Control in Bounded Petri Nets
• Introduction to Discrete Event Systems
• Estimation and Inference in Discrete Event Systems
• Verification of State-Based Opacity Using Petri Nets
• Introduction to Petri Nets
• Structural Analysis of Petri Nets
• Lectures on Concurrency and Petri Nets