By Topic

An algebraic approach to modeling probabilistic discrete event systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
V. K. Garg ; Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA

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

Published in:

Decision and Control, 1992., Proceedings of the 31st IEEE Conference on

Date of Conference: