NDLI: A probabilistic language formalism for stochastic discrete-event systems

Content Provider	IEEE Xplore Digital Library
Author	Garg, V.K. Kumar, R. Marcus, S.I.
Copyright Year	1963
Abstract	The formalism of probabilistic languages has been introduced for modeling the qualitative behavior of stochastic discrete-event systems. A probabilistic language is a unit interval-valued map over the set of traces of the system satisfying certain consistency constraints. Regular language operators such as choice, concatenation, and Kleene-closure have been defined in the setting of probabilistic languages to allow modeling of complex systems in terms of simpler ones. The set of probabilistic languages is closed under such operators, thus forming an algebra. It also is a complete partial order under a natural ordering in which the operators are continuous. Hence, recursive equations can be solved in this algebra. This is alternatively derived by using the contraction mapping theorem on the set of probabilistic languages which is shown to be a complete metric space. The notion of regularity, i.e., finiteness of automata representation, of probabilistic languages has been defined and it is shown that regularity is preserved under choice, concatenation, and Kleene-closure. We show that this formalism is also useful in describing system performance measures such as completion time, reliability, etc., and present properties to aide their computation.
Sponsorship	IEEE Control Systems Society
Starting Page	280
Ending Page	293
Page Count	14
File Size	679479
File Format	PDF
ISSN	00189286
Volume Number	44
Issue Number	2
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1999-02-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Stochastic systems Discrete event systems Automata Algebra Equations Extraterrestrial measurements System performance Time measurement Robotics and automation Manufacturing
Content Type	Text
Resource Type	Article
Subject	Control and Systems Engineering Electrical and Electronic Engineering Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Discrete event systems with stochastic processing times

Optimal Supervisory Control of Probabilistic Discrete Event Systems

On the transparency of automata as discrete-event control specifications

Performance evaluation of (max,+) automata

Diagnosability of stochastic discrete-event systems

Probabilistic Supervisory Control of Probabilistic Discrete Event Systems

Safe Diagnosability of Stochastic Discrete Event Systems

The ICRA Robot Challenge [Competitions]

Discrete approximation and supervisory control of continuous systems

A probabilistic language formalism for stochastic discrete-event systems

Similar Documents

Discrete event systems with stochastic processing times

Optimal Supervisory Control of Probabilistic Discrete Event Systems

On the transparency of automata as discrete-event control specifications

Performance evaluation of (max,+) automata

Diagnosability of stochastic discrete-event systems

Probabilistic Supervisory Control of Probabilistic Discrete Event Systems

Safe Diagnosability of Stochastic Discrete Event Systems

The ICRA Robot Challenge [Competitions]

Discrete approximation and supervisory control of continuous systems

A probabilistic language formalism for stochastic discrete-event systems