Uniform random sampling of traces in very large models

This paper presents some first results on how to perform uniform random walks (where every trace has the same probability to occur) in very large models. The models considered here are described in a succinct way as a set of communicating reactive modules. The method relies upon techniques for counting and drawing uniformly at random words in regular languages. Each module is considered as an automaton defining such a language. It is shown how it is possible to combine local uniform drawings of traces, and to obtain some global uniform random sampling, without construction of the global model.

[1]  Ana R. Cavalli,et al.  Hit-or-Jump: An algorithm for embedded testing with applications to IN services , 1999, FORTE.

[2]  David Lee,et al.  Conformance testing of protocols specified as communicating finite state machines-a guided random walk based approach , 1996, IEEE Trans. Commun..

[3]  Thomas A. Henzinger,et al.  MOCHA: Modularity in Model Checking , 1998, CAV.

[4]  Markus Endler,et al.  Development of an atomic-broadcast protocol using LOTOS , 1999 .

[5]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[6]  Ivana Černá,et al.  Enhancing random walk state space exploration , 2005, FMICS '05.

[7]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[8]  Richard Lassaigne,et al.  Probabilistic Verification and Approximation , 2006, Electron. Notes Theor. Comput. Sci..

[9]  David Lee,et al.  Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.

[10]  Philippe Flajolet,et al.  A Calculus for the Random Generation of Labelled Combinatorial Structures , 1994, Theor. Comput. Sci..

[11]  Thomas A. Henzinger,et al.  Reactive Modules , 1999, Formal Methods Syst. Des..

[12]  Marta Z. Kwiatkowska,et al.  Probabilistic symbolic model checking with PRISM: a hybrid approach , 2004, International Journal on Software Tools for Technology Transfer.

[13]  Markus Endler,et al.  Development of an Atomic-Broadcast Protocol Using LOTOS , 1999, Softw. Pract. Exp..

[14]  Thomas A. Henzinger,et al.  jMocha: a model checking tool that exploits design structure , 2001, Proceedings of the 23rd International Conference on Software Engineering. ICSE 2001.

[15]  Christos H. Papadimitriou,et al.  On the Random Walk Method for Protocol Testing , 1994, CAV.

[16]  Richard M. Karp,et al.  Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[17]  Radu Grosu,et al.  Monte Carlo Model Checking , 2005, TACAS.

[18]  André Arnold,et al.  Finite transition systems - semantics of communicating systems , 1994, Prentice Hall international series in computer science.

[19]  Thomas Hérault,et al.  Probabilistic verification of sensor networks , 2006, 2006 International Conference onResearch, Innovation and Vision for the Future.

[20]  André Arnold,et al.  Finite transition systems , 1994 .

[21]  Jan Tretmans,et al.  Testing Transition Systems: An Annotated Bibliography , 2000, MOVEP.

[22]  Thomas Hérault,et al.  Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC , 2005, AVoCS.

[23]  Alain Denise,et al.  A new way of automating statistical testing methods , 2001, Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001).

[24]  D. Aldous.  An introduction to covering problems for random walks on graphs , 1989 .

[25]  Thomas Hérault,et al.  Approximate Probabilistic Model Checking , 2004, VMCAI.

[26]  Alain Denise,et al.  A generic method for statistical testing , 2004, 15th International Symposium on Software Reliability Engineering.

[27]  Thomas A. Henzinger,et al.  Reactive Modules , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[28]  Richard M. Karp,et al.  Monte-Carlo Approximation Algorithms for Enumeration Problems , 1989, J. Algorithms.

[29]  Jacques Cohen,et al.  Uniform Random Generation of Strings in a Context-Free Language , 1983, SIAM J. Comput..

[30]  Mark Jerrum,et al.  The Markov chain Monte Carlo method: an approach to approximate counting and integration , 1996 .

[31]  Philippe Flajolet,et al.  Analytic combinatorics : functional equations, rational and algebraic functions , 2001 .

[32]  Ganesh Gopalakrishnan,et al.  Random Walk Based Heuristic Algorithms for Distributed Memory Model Checking , 2003, PDMC@CAV.

[33]  Thomas Hérault,et al.  Distribution, Approximation and Probabilistic Model Checking , 2006, PDMC@ICALP.

[34]  Colin H. West.  Protocol Validation in Complex Systems , 1989, SIGCOMM.