… reachability tree of a structured transition system; it allows one to decide the finite reachability
tree problem (also called the finite termination problem) and the finite reachability set …

… Our present paper contributes to this with a generalization of reachability trees, which is … of
reachability trees for HL-nets. The basic idea of a reachability tree is to organize all reachable …

… Our present paper constitutes the first steps towards a generalization of reachability trees, …
how to define reachability trees for HL-nets (HL-trees). For PT-nets the reachability trees in [2,7,…

… to analyse dynamic properties of statecharts; reachability from any … reachability tree for
statecharts presents some difficulties, and we show how these problems were solved in the tree …

… a path in the tree. However, the tree is so large even for a small Petri net. Hence, we propose
a reduced reachability tree called a time-feasible reachability tree by eliminating infeasible …

… reachability tree analysis method is greatly limited by the fact that the reachability tree of a
Petri net may be an infinite tree … to find some finite representations for reachability trees [4], [5]. …

… In order to decrease the number of nodes in a reachability tree, this work proposes a reduced
reachability tree for ωindependent nets based on NMRTs, and we call it an ωRT for short. …

… After revealing the root causes of net unboundedness and some reachability properties of
unbounded nets, this work presents a new finite reachability tree called lean reachability tree (…

… To help understanding the reachability labeling for path-tree cover, we start with a simple
path-path scenario, that is, path-path relationship itself forms a path, a special case of tree. For …

… However, existing reachability trees can only solve … reachability trees in the deadlock
detection field, this paper presents a new type of reachability trees called complex reachability tree (…