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 recalls the reveals relations defined in [3], and proposes an algorithm to compute them on bounded equal-conflict PT systems, using a smaller structure than the one defined in [3].
Adobbati, F., Bernardinello, L., Kilinc Soylu, G., Pomello, L. (2024). Computing a Parametric Reveals Relation For Bounded Equal-Conflict Petri Nets. In M. Koutny, R. Bergenthum, G. Ciardo (a cura di), Transactions on Petri Nets and Other Models of Concurrency XVII (pp. 54-83). Springer Science and Business Media Deutschland GmbH [10.1007/978-3-662-68191-6_3].
Computing a Parametric Reveals Relation For Bounded Equal-Conflict Petri Nets
Adobbati, F;Bernardinello, L
;Pomello, L
2024
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 recalls the reveals relations defined in [3], and proposes an algorithm to compute them on bounded equal-conflict PT systems, using a smaller structure than the one defined in [3].
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
