Attributed transition systems with hidden transitions / Skobelev. (2017)
Ukrainian

English  Cybernetics and Systems Analysis   /     Issue (2017, 53 (4))

Skobelev V.V.
Attributed transition systems with hidden transitions

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. © 2017, Springer Science+Business Media, LLC.

Keywords: admissibility, attributed transition system, hidden transition, safeness and correctness of systems, Cybernetics, admissibility, Attributed transition system, Final state, hidden transition, Set-theoretic analysis, System structures, Computer science


Cite:
Skobelev V.V. (2017). Attributed transition systems with hidden transitions. Cybernetics and Systems Analysis, 53 (4), 37-49. doi: https://doi.org/10.1007/s10559-017-9954-2 http://jnas.nbuv.gov.ua/article/UJRN-0000719119 [In Russian].


 

Institute of Information Technologies of VNLU


+38 (044) 525-36-24
Ukraine, 03039, Kyiv, Holosiivskyi Ave, 3, room 209