Decidability of opacity verification problems in labeled Petri net systems

Tong, Y;Li, Z;SEATZU, CARLA;GIUA, ALESSANDRO
2017-01-01

Abstract

A system is said to be opaque if an intruder that observes its evolution through a mask cannot infer that the system's evolution belongs to a given secret behavior. Opacity verification is the problem of determining whether the system is opaque with respect to a given secret or not. In this paper we address the decidability of the opacity verification problem. Using reduction approaches, we show that verification of initial-state, current-state, and language opacity is undecidable in labeled Petri nets.
2017
2017
Inglese
AUTOMATICA
80
48
53
6
WOS:000401391800007
2-s2.0-85016153323
http://www.elsevier.com/wps/find/journaldescription.cws_home/270/description#description
http://www.sciencedirect.com/science/article/pii/S0005109817300237#!
Esperti anonimi
internazionale
scientifica
Decidability problems; Discrete event systems; Opacity; Petri nets; Control and Systems Engineering; Electrical and Electronic Engineering
sì
Tong, Y; Li, Z; Seatzu, Carla; Giua, Alessandro
1.1 Articolo in rivista
info:eu-repo/semantics/article
1 Contributo su Rivista::1.1 Articolo in rivista
262
4
partially_open
Files in This Item:
File Size Format  
Giua et al_AUTOMATICA_80_2017.pdf

Solo gestori archivio

Description: articolo
Type: versione editoriale
Size 682.48 kB
Format Adobe PDF
& nbsp; View / Open   Request a copy
682.48 kB Adobe PDF & nbsp; View / Open   Request a copy
17aut_a_draft.pdf

open access

Type: versione post-print
Size 411.28 kB
Format Adobe PDF
View/Open
411.28 kB Adobe PDF View/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Questionnaire and social

Share on:
Impostazioni cookie