Petri nets are an important formal paradigm for modeling and analysis of discrete event systems. The related areas of application of Petri nets include deadlock avoidance and prevention, supervisory control, forbidden state detection, different aspects of flexible manufacturing systems, and many others (Zhou & DiCesare, 1993; Holloway et al., 1997; Boel et al., 1995). Quite often, given a discr...

Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasses of Petri nets for which the reachability problem is PSPACE-complete. These subclasses are not contained in any other subclass for which complexity of the reachability problem was known, such as those given in Esparza...

This paper proposes an algorithm for analyzing the reachability property of Petri nets by the use of unfoldings. It is known that analyzing the reachability by using unfoldings requires exponential time and space to the size of unfolding. The algorithm is based on the branch and bound technique, and experimental results show efficiency of the algorithm. key words: Petri nets, unfoldings, reacha...

In this paper, the reachability problem for a class of second-order LTI switched systems is solved. The reachability problem is first explored for switched systems consisting of two subsystems and switching control laws are proposed that can drive the system state from an initial point to a target point via finitely many switches. The method is then extended to the case of several subsystems. T...

This study discusses the analysis method for obtaining solutions that allow de-escalation in international conflicts within framework of Graph Model Conflict Resolution. CD games, a conflict type which two decision-makers can choose Cooperate (C) or Defect (D) strategies, are analyzed by examining state transition and stability decision makers with focus on reachability. Based analysis, new con...

We give polynomial time algorithms for quantitative (and qualitative) reachability analysis for Branching Markov Decision Processes (BMDPs). Specifically, given a BMDP, and given an initial population, where the objective of the controller is to maximize (or minimize) the probability of eventually reaching a population that contains an object of a desired (or undesired) type, we give algorithms...