A decomposition theorem for finite persistent transition systems

摘要

In this paper, we consider finite labelled transition systems. We show that if such transition systems are deterministic, persistent, and weakly periodic, then they can be decomposed in the following sense. There exists a finite set of label-disjoint cycles such that any other cycle is Parikh-equivalent to a multiset of cycles from this set.