Undecidability results for distributed probabilistic systems
From MaRDI portal
Undecidability and degrees of sets of sentences (03D35) Specification and verification (program logics, model checking, etc.) (68Q60) 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
- Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms
- Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
- Concurrent Probabilistic Programs, Or: How to Schedule If You Must
- Schedulers are no prophets
- Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
Cited in
(11)- Using schedulers to test probabilistic distributed systems
- Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms
- Undecidability in decentralized supervision
- Schedulers are no prophets
- Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge
- Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
- Undecidability of accordance for open systems with unbounded message queues
- Reachability in networks of register protocols under stochastic schedulers
- Verification of partial-information probabilistic systems using counterexample-guided refinements
- On the (High) Undecidability of Distributed Synthesis Problems
- Information hiding in probabilistic concurrent systems
This page was built for publication: Undecidability results for distributed probabilistic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3651281)
