Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms

DOI10.1016/j.tcs.2013.07.017zbMath1359.68168OpenAlexW2022019677MaRDI QIDQ2453112

Luis María Ferrer Fioriti, Sergio Giro, Pedro R. D'Argenio

Publication date: 6 June 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.07.017

zbMATH Keywords

Markov decision processesdistributed systemsinterleavingnondeterminismpartial observationprobabilistic systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

The complexity of reachability in parametric Markov decision processes ⋮ On the Complexity of Reachability in Parametric Markov Decision Processes ⋮ Distributed Synthesis in Continuous Time

Uses Software

• PRISM
• LiQuor

Cites Work

• Unnamed Item
• Information hiding in probabilistic concurrent systems
• On the undecidability of probabilistic planning and related stochastic optimization problems
• Switched PIOA: parallel composition via distributed scheduling
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Composition and behaviors of probabilistic I/O automata
• Reactive, generative, and stratified models of probabilistic processes
• A framework for analyzing probabilistic protocols and its application to the partial secrets exchange
• Secure information flow by self-composition
• Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
• Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
• Retaining the Probabilities in Probabilistic Testing Theory
• Undecidability Results for Distributed Probabilistic Systems
• Verification of Partial-Information Probabilistic Systems Using Counterexample-Guided Refinements

This page was built for publication: Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms