Title :
An algebraic approach to modeling probabilistic discrete event systems
Author_Institution :
Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA
Abstract :
The author defines probabilistic languages and probabilistic automata over a finite set of events. Operators under which the set of probabilistic languages (p-languages) is closed, thus forming an algebra of p-languages, are also defined. It is shown that the operators are continuous in it. Hence, recursive equations may be defined in this algebra using fixpoints of continuous functions. Thus, p-languages form a suitable theoretical foundation for specifying and analyzing probabilistic systems
Keywords :
algebra; automata theory; formal languages; probabilistic logic; algebra; p-languages; probabilistic automata; probabilistic discrete event systems; probabilistic languages; recursive equations; Algebra; Automata; Equations; Formal languages; Fuzzy set theory; Fuzzy sets; Joining processes; Performance analysis; Stochastic processes; Supervisory control; Upper bound;
Conference_Titel :
Decision and Control, 1992., Proceedings of the 31st IEEE Conference on
Conference_Location :
Tucson, AZ
Print_ISBN :
0-7803-0872-7
DOI :
10.1109/CDC.1992.371373
