This paper conducts the set-theoretic analysis of the structure of attributed transition systems with hidden transitions on the assumption that the set of states for which the set of transitions… Click to show full abstract
This paper conducts the set-theoretic analysis of the structure of attributed transition systems with hidden transitions on the assumption that the set of states for which the set of transitions can be extended is fixed and does not change the system structure. Cases are investigated when priorities of hidden and available actions coincide or the priority of hidden actions is higher than the priority of available actions. In terms of systems with singled out initial and final states, the classes of admissible, safe, and correct systems are defined and characterized. The algebra of such systems is constructed.
               
Click one of the above tabs to view related content.