Reduction and covering of infinite reachability trees
نویسندگان
چکیده
منابع مشابه
Reduction and covering of infinite reachability trees
We present a structure for transition systems with which the main decidability results on Petri nets can be generalized to structured transition systems. We define the reduced 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 problem. A general definition ...
متن کاملCovering Grids by Trees
Given n points in the plane, a covering tree is a tree whose edges are line segments that jointly cover all the points. Let Gn be a n× · · · × n grid in Z. It is known that Gn can be covered by an axis-aligned polygonal path with 32n 2 + O(n) edges, thus in particular by a polygonal tree with that many edges. Here we show that every covering tree for the n points of Gn has at least (1 + c3)n 2 ...
متن کاملWeak Covering Properties and Infinite Games
We investigate game-theoretic properties of selection principles related to weaker forms of the Menger and Rothberger properties. For appropriate spaces some of these selection principles are characterized in terms of a corresponding game. We use generic extensions by Cohen reals to illustrate the necessity of some of the hypotheses in our theorems.
متن کاملThe Reachability Problem over Infinite Graphs
We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is central for automatic verification of infinitestate systems. Our focus is on graphs that are presented in terms of word or tree rewriting systems. 1 Historical Introduction In a rather unknown paper of 1910, titled Die Lösung eines S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1990
ISSN: 0890-5401
DOI: 10.1016/0890-5401(90)90009-7