On Almost-Sure Properties of Probabilistic Discrete Event Systems

DOI10.3233/FI-2011-548MaRDI QIDQ3100947zbMATH OpenOpenAlexFDO

Authors 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

forbidden-state avoidancePetri netprobabilistic controlled transition systemreachability

Mathematics Subject Classification ID

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) Discrete event control/observation systems (93C65)

Recommendations

• A probabilistic language formalism for stochastic discrete-event systems
• scientific article; zbMATH DE number 1905115
• Robust predictability of stochastic discrete-event systems and a polynomial-time verification
• Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
• Sur une théorie d'une classe de systèmes probabilistes
• Algebraic structure of some stochastic discrete event systems, with applications
• scientific article; zbMATH DE number 512839
• A decomposition theorem for probabilistic transition systems
• scientific article; zbMATH DE number 1507207

Cited in

(3)

• Reachability in networks of register protocols under stochastic schedulers
• Zero-reachability in probabilistic multi-counter automata
• State explosion in almost-sure probabilistic reachability

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)