Issues with Path Representation in Transition Systems

Structured analysis of transition systems concerns paths, building blocks, representations, and effective computations of semantics, thus having significant influence on practical applications of graph theory. For instance, part of these results plays important roles in formal language studies, compiler designs and genetic programming. This paper aims to introduce relations among them, and to present related algorithms for calculating of them.