Analysis of the Structure of Attributed Transition Systems Without Hidden Transitions

This paper carries out a set-theoretic analysis of the structure of attributed transition systems without hidden transitions. Partial operations of composition of histories and traces are proposed. It is shown that these operations can be used to parallelize the design of coverings of sets of histories and traces. Equivalence relations on a set of states are extracted. In terms of systems with singled out initial and final states and also systems with singled out initial states and sets of final limit sets of states, classes of safe and correct systems are defined. The algebra of such systems is proposed.