Isomorphism between L-valued tree transition systems and upper semilattice

Abstract

This study aims to investigate the characterization of algebraic concepts of subsystem, retrievability and connectivity of an L-valued tree transition system based on its related layers. It also seeks to associate upper semilattices with L-valued tree transition systems. Further, a decomposition of an L-valued tree transition system is provided in terms of its layers. In addition, it proposes a construction of an Lvalued tree transition system which corresponds to a given finite poset. Then an isomorphism is established between the poset of class of subsystem of an L-valued tree transition system and an upper semilattice.