Computing a parametric reveals relation for bounded equal-conflict Petri nets

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]. © 2024, The Author(s), under exclusive license to Springer-Verlag GmbH, DE, part of Springer Nature.