Time-bounded reachability in distributed input/output interactive probabilistic chains

Authors:
Georgel Calin;Pepijn Crouzen;Pedro R. D'Argenio;E. Moritz Hahn;Lijun Zhang
Affiliations:
Department of Computer Science, Saarland University, Saarbrücken, Germany;Department of Computer Science, Saarland University, Saarbrücken, Germany;FaMAF, Universidad Nacional de Córdoba, Córdoba, Argentina;Department of Computer Science, Saarland University, Saarbrücken, Germany;DTU Informatics, Technical University of Denmark, Denmark
Venue:
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Year:
2010

Citing 14
Cited 0

The dining cryptographers problem: unconditional sender and recipient untraceability

Journal of Cryptology
Some algebraic and geometric computations in PSPACE

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Modeling and verification of randomized distributed real-time systems

Modeling and verification of randomized distributed real-time systems
Model Checking of Probabalistic and Nondeterministic Systems

Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Quantitative evaluation in embedded system design: validation of multiprocessor multithreaded architectures

Proceedings of the conference on Design, automation and test in Europe
Towards Performance Prediction of Compositional Models in Industrial GALS Designs

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
On the Expressive Power of Schedulers in Distributed Probabilistic Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
A compositional semantics for dynamic fault trees in terms of interactive Markov chains

ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Quantitative model checking revisited: neither decidable nor approximable

FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Symbolic and parametric model checking of discrete-time markov chains

ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Switched probabilistic i/o automata

ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
PARAM: a model checker for parametric markov models

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Retaining the probabilities in probabilistic testing theory

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Model checking interactive markov chains

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results we consider the recently introduced class of (strongly) distributed schedulers, for which no analysis techniques are known. Our algorithm is based on reformulating the nondeterministic models as parametric ones, by interpreting scheduler decisions as parameters. We then apply the PARAM tool to extract the reachability probability as a polynomial function, which we optimize using nonlinear programming.