On Almost-Sure Properties of Probabilistic Discrete Event Systems

DOI10.3233/FI-2011-548zbMATH Open1234.68313OpenAlexW64054199MaRDI QIDQ3100947

Hsu-Chun Yen

Publication date: 22 November 2011

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2011-548

zbMATH Keywords

reachabilityPetri netforbidden-state avoidanceprobabilistic controlled transition system

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A decomposition theorem for probabilistic transition systems 👍 👎
• Algebraic structure of some stochastic discrete event systems, with applications 👍 👎
• Robust predictability of stochastic discrete-event systems and a polynomial-time verification 👍 👎
• A probabilistic language formalism for stochastic discrete-event systems 👍 👎
• Sur une théorie d'une classe de systèmes probabilistes 👍 👎
• Logical Characterizations of Bisimulations for Discrete Probabilistic Systems 👍 👎

This page was built for publication: On Almost-Sure Properties of Probabilistic Discrete Event Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100947)