The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Composition and behaviors of probabilistic I/O automata
Theoretical Computer Science
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
LiQuor: A tool for Qualitative and Quantitative Linear Time analysis of Reactive Systems
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Switched PIOA: parallel composition via distributed scheduling
Theoretical Computer Science - Components and objects
Theoretical Computer Science
On the verification of probabilistic I/O automata with unspecified rates
Proceedings of the 2009 ACM symposium on Applied Computing
Quantitative model checking revisited: neither decidable nor approximable
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Composing systems while preserving probabilities
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Time-bounded reachability in distributed input/output interactive probabilistic chains
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Retaining the probabilities in probabilistic testing theory
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Probabilistic CSP: preserving the laws via restricted schedulers
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Taming confusion for modeling and implementing probabilistic concurrent systems
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Hi-index | 0.00 |
In this paper, we consider several subclasses of distributed schedulers and we investigate the ability of these subclasses to attain worst-case probabilities. Based on previous work, we consider the class of distributed schedulers, and we prove that randomization adds no extra power to distributed schedulers when trying to attain the supremum probability of any measurable set, thus showing that the subclass of deterministic schedulers suffices to attain the worst-case probability. Traditional schedulers are a particular case of distributed schedulers. So, since our result holds for any measurable set, our proof generalizes the well-known result that randomization adds no extra power to schedulers when trying to maximize the probability of an @w-regular language. However, non-Markovian schedulers are needed to attain supremum probabilities in distributed systems. We develop another class of schedulers (the strongly distributed schedulers) that restricts the nondeterminism concerning the order in which components execute. We compare this class against previous approaches in the same direction, showing that our definition is an important contribution. For this class, we show that randomized and non-Markovian schedulers are needed to attain worst-case probabilities. We also discuss the subclass of finite-memory schedulers, showing the intractability of the model checking problem for these schedulers.