Abstract
We present a categorical framework to study probabilistic automata starting by obtaining aggregation and interconnection as universal constructions. We also introduce the notion of probabilistic behavior in order to get adjunctions between probabilistic behavior and probabilistic automata. Thus we are able to extend to the probabilistic setting free and minimal realization as universal constructions.
Cite
CITATION STYLE
Mateus, P., Sernadas, A., & Sernadas, C. (2000). Realization of probabilistic automata: Categorical approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1827, pp. 237–251). Springer Verlag. https://doi.org/10.1007/978-3-540-44616-3_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
