A system is said to be opaque if a given secret behavior remains opaque (uncertain) to an intruder who can partially observe system activities. This work addresses the verification of state-based opacity in systems modeled with Petri nets. The secret behavior of a system is defined as a set of states. More precisely, two state-based opacity properties are considered: current-state opacity and initial-state opacity. We show that both current-state and initial-state opacity problems in bounded Petri nets can be efficiently solved by using a compact representation of the reachability graph, called basis reachability graph (BRG). This approach is practically efficient since the exhaustive enumeration of the reachability space can be avoided.
This correspondence develops a methodology to synthesize supervisors for a special class of Petri nets that can well model many flexible manufacturing systems. In our previous work, siphons in a Petri net are divided into elementary and dependent ones on the condition that all emptiable minimal siphons are computed. In this research, a mixed integer programming (MIP)-based deadlock detection technique is used to find some, in general not all, minimal siphons in a plant model without complete siphon enumeration. For each siphon found, depending on its noncontrollability, a monitor is added such that it is invariant-controlled. Our siphon control method guarantees that no emptiable control-induced siphon is generated due to the addition of the monitors. The siphon control process proceeds iteratively until there is no unmarked siphon in the supervisor of a plant model. Compared with the existing approaches, the novel deadlock prevention policy can usually lead to a structurally simple liveness-enforcing supervisor by adding only a small number of monitors and arcs. More importantly, complete siphon enumeration is avoided. A practical flexible manufacturing system (FMS) example is utilized to illustrate the proposed methods.Index Terms-Deadlock prevention, elementary siphon, flexible manufacturing system (FMS), Petri net.
Deadlock control approaches based on Petri nets are usually implemented by adding control places and related arcs to the Petri net model of a system. The main disadvantage of the existing policies is that many control places and associated arcs are added to the initially constructed Petri net model, which significantly increases the complexity of the supervisor of the Petri net model. The objective of this study is to develop a two-step robust deadlock control approach. In the first step, we use a method of deadlock prevention based on strict minimal siphons (SMSs) to create a controlled Petri net model. In the second step, all control places obtained in the first step are merged into a single control place based on the colored Petri net to mark all SMSs. Finally, we compare the proposed method with the existing methods from the literature.
Rumors can propagate at great speed through social networks and produce significant damages. In order to control rumor propagation, spreading correct information to counterbalance the effect of the rumor seems more appropriate than simply blocking rumors by censorship or network disruption. In this paper, a competitive diffusion model, namely Linear Threshold model with One Direction state Transition (LT1DT), is proposed for modeling competitive information propagation of two different types in a same network. The problem of minimizing rumor spread in social networks is explored and a novel heuristic based on diffusion dynamics is proposed to solve this problem under the LT1DT. Experimental analysis on four different networks shows that the novel heuristic outperforms pagerank centrality. By seeding correct information in the proximity of rumor seeds, the novel heuristic performs as well as the greedy approach in scale-free and small-world networks but runs three orders of magnitude faster than the greedy approach.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.