In a distributed system, in which an action can be either “hidden” or “observable”, an unwanted information flow might arise when occurrences of observable actions give information about occurrences of hidden actions. A collection of relations, i.e. reveals and its variants, is used to model such information flow among transitions of a Petri net. This paper introduces a parametrised generalisation to the existing reveals relations and provides a formal basis for information-flow analysis of bounded equal-conflict PT systems.
Adobbati, F., Bernardinello, L., Soylu, G., Pomello, L. (2022). Information Flow Among Transitions of Bounded Equal-Conflict Petri Nets. In Petri Nets and Software Engineering 2022 co-located with the 43rd International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2022) (pp.60-79). CEUR-WS.
Information Flow Among Transitions of Bounded Equal-Conflict Petri Nets
Adobbati F.;Bernardinello L.;Pomello L.
2022
Abstract
In a distributed system, in which an action can be either “hidden” or “observable”, an unwanted information flow might arise when occurrences of observable actions give information about occurrences of hidden actions. A collection of relations, i.e. reveals and its variants, is used to model such information flow among transitions of a Petri net. This paper introduces a parametrised generalisation to the existing reveals relations and provides a formal basis for information-flow analysis of bounded equal-conflict PT systems.
| File | Dimensione | Formato | |
|---|---|---|---|
|
Adobbati-2022-CEURWS-VoR.pdf
accesso aperto
Tipologia di allegato:
Publisher’s Version (Version of Record, VoR)
Licenza:
Creative Commons
Dimensione
1.1 MB
Formato
Adobe PDF
|
1.1 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
