{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:14Z","timestamp":1759637834715,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198106"},{"type":"electronic","value":"9783642198113"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19811-3_10","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T09:06:18Z","timestamp":1300093578000},"page":"127-140","source":"Crossref","is-referenced-by-count":14,"title":["Uniform Monte-Carlo Model Checking"],"prefix":"10.1007","author":[{"given":"Johan","family":"Oudinet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Denise","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-Claude","family":"Gaudel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Lassaigne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Peyronnet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-85114-1_16","volume-title":"Model Checking Software","author":"N. Abed","year":"2008","unstructured":"Abed, N., Tripakis, S., Vincent, J.-M.: Resource-aware verification using randomized exploration of large state spaces. In: Havelund, K., Majumdar, R. (eds.) SPIN 2008. LNCS, vol.\u00a05156, pp. 214\u2013231. Springer, Heidelberg (2008)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Formal Methods for Industrial Applications, Specifying and Programming the Steam Boiler Control (the book grow out of a Dagstuhl Seminar)","year":"1996","unstructured":"Abrial, J.-R., B\u00f6rger, E., Langmaack, H. (eds.): Formal Methods for Industrial Applications, Specifying and Programming the Steam Boiler Control (the book grow out of a Dagstuhl Seminar). LNCS, vol.\u00a01165. Springer, Heidelberg (1996)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BF01047002","volume":"4","author":"D. Aldous","year":"1991","unstructured":"Aldous, D.: An introduction to covering problems for random walks on graphs. J. Theoret. Probab.\u00a04, 197\u2013211 (1991)","journal-title":"J. Theoret. Probab."},{"key":"10_CR4","volume-title":"Model-Checking Techniques and Tools","author":"B. B\u00e9rard","year":"2001","unstructured":"B\u00e9rard, B., Bidoit, M., Finkel, A., Laroussinie, F., Petit, A., Petrucci, L., Schnoebelen, P.: Systems and Software Verification. In: Model-Checking Techniques and Tools, Springer, Heidelberg (2001)"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF00121128","volume":"1","author":"C. Courcoubetis","year":"1992","unstructured":"Courcoubetis, C., Vardi, M., Wolper, P., Yannakakis, M.: Memory-efficient algorithms for the verification of temporal properties. Formal methods in system design\u00a01(2), 275\u2013288 (1992)","journal-title":"Formal methods in system design"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/ISSRE.2004.2","volume-title":"15th International Symposium on Software Reliability Engineering (ISSRE 2004)","author":"A. Denise","year":"2004","unstructured":"Denise, A., Gaudel, M.-C., Gouraud, S.-D.: A generic method for statistical testing. In: 15th International Symposium on Software Reliability Engineering (ISSRE 2004), pp. 25\u201334. IEEE Computer Society, Los Alamitos (2004)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Denise, A., Gaudel, M.-C., Gouraud, S.-D., Lassaigne, R., Peyronnet, S.: Uniform random sampling of traces in very large models. In: 1st International ACM Workshop on Random Testing, pp. 10\u201319 (July 2006)","DOI":"10.1145\/1145735.1145738"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Dwyer, M.B., Elbaum, S.G., Person, S., Purandare, R.: Parallel randomized state-space search. In: 29th International Conference on Software Engineering (ICSE 2007), pp. 3\u201312 (2007)","DOI":"10.1109\/ICSE.2007.62"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-44585-4_6","volume-title":"Computer Aided Verification","author":"P. Gastin","year":"2001","unstructured":"Gastin, P., Oddoux, D.: Fast LTL to B\u00fcchi automata translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 53\u201365. Springer, Heidelberg (2001)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Gaudel, M.-C., Denise, A., Gouraud, S.-D., Lassaigne, R., Oudinet, J., Peyronnet, S.: Coverage-biased random exploration of large models. In: 4th ETAPS Workshop on Model Based Testing. Electronic Notes in Theoretical Computer Science, vol.\u00a0220(1,10), pp. 3\u201314 (2008) (invited lecture)","DOI":"10.1016\/j.entcs.2008.11.002"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-540-31980-1_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Grosu","year":"2005","unstructured":"Grosu, R., Smolka, S.A.: Monte Carlo model checking. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 271\u2013286. Springer, Heidelberg (2005)"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1145\/321832.321835","volume":"21","author":"M.S. Hecht","year":"1974","unstructured":"Hecht, M.S., Ullman, J.D.: Characterizations of reducible flow graphs. J. ACM\u00a021(3), 367\u2013375 (1974)","journal-title":"J. ACM"},{"issue":"4","key":"10_CR13","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1137\/0212044","volume":"12","author":"T. Hickey","year":"1983","unstructured":"Hickey, T., Cohen, J.: Uniform random generation of strings in a context-free language. SIAM J. Comput.\u00a012(4), 645\u2013655 (1983)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"D.B. Johnson","year":"1975","unstructured":"Johnson, D.B.: Finding all the elementary circuits of a directed graph. SIAM J. Comput.\u00a04(1), 77\u201384 (1975)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10_CR15","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s00165-008-0086-3","volume":"20","author":"S. Labb\u00e9","year":"2008","unstructured":"Labb\u00e9, S., Gallois, J.-P.: Slicing communicating automata specifications: polynomial algorithms for model reduction. Formal Asp. Comput.\u00a020(6), 563\u2013595 (2008)","journal-title":"Formal Asp. Comput."},{"key":"10_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8643-8","volume-title":"Non-Uniform Random Variate Generation","author":"L. Devroye","year":"1986","unstructured":"Devroye, L.: Non-Uniform Random Variate Generation. Springer, Heidelberg (1986)"},{"key":"10_CR17","first-page":"26","volume-title":"RT 2007: Proceedings of the 2nd international workshop on Random testing","author":"J. Oudinet","year":"2007","unstructured":"Oudinet, J.: Uniform random walks in very large models. In: RT 2007: Proceedings of the 2nd International Workshop on Random Testing, pp. 26\u201329. ACM Press, New York (2007)"},{"key":"10_CR18","unstructured":"Oudinet, J., Denise, A., Gaudel, M.-C.: A new dichotomic algorithm for the uniform random generation of words in regular languages. In: Conference on random and exhaustive generation of combinatorial objects (GASCom), Montreal, Canada, p. 10 (September 2010)"},{"key":"10_CR19","first-page":"98","volume-title":"Proc. of Formal Methods for Industrial Critical Systems (FMICS 2005)","author":"R. Pel\u00e1nek","year":"2005","unstructured":"Pel\u00e1nek, R., Han\u017el, T., \u010cern\u00e1, I., Brim, L.: Enhancing random walk state space exploration. In: Proc. of Formal Methods for Industrial Critical Systems (FMICS 2005), Lisbon, Portugal, pp. 98\u2013105. ACM Press, New York (2005)"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-73370-6_5","volume-title":"Model Checking Software","author":"N. Rungta","year":"2007","unstructured":"Rungta, N., Mercer, E.G.: Generating counter-examples through randomized guided search. In: Bo\u0161na\u010dki, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol.\u00a04595, pp. 39\u201357. Springer, Heidelberg (2007)"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Sivaraj, H., Gopalakrishnan, G.: Random walk based heuristic algorithms for distributed memory model checking. In: Proc. of Parallel and Distributed Model Checking (PDMC 2003). Electr. Notes Theor. Comput. Sci., vol.\u00a089(1) (2003)","DOI":"10.1016\/S1571-0661(05)80096-9"},{"issue":"3","key":"10_CR22","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/0202017","volume":"2","author":"R.E. Tarjan","year":"1973","unstructured":"Tarjan, R.E.: Enumeration of the elementary circuits of a directed graph. SIAM J. Comput.\u00a02(3), 211\u2013216 (1973)","journal-title":"SIAM J. Comput."},{"issue":"12","key":"10_CR23","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1145\/362814.362819","volume":"13","author":"J.C. Tiernan","year":"1970","unstructured":"Tiernan, J.C.: An efficient search algorithm to find the elementary circuits of a graph. Commun. ACM\u00a013(12), 722\u2013726 (1970)","journal-title":"Commun. ACM"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/3-540-60915-6_6","volume-title":"Logics for Concurrency","author":"M.Y. Vardi","year":"1996","unstructured":"Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol.\u00a01043, pp. 238\u2013266. Springer, Heidelberg (1996)"},{"issue":"1","key":"10_CR25","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/321679.321684","volume":"19","author":"H. Weinblatt","year":"1972","unstructured":"Weinblatt, H.: A new search algorithm for finding the simple cycles of a finite directed graph. J. ACM\u00a019(1), 43\u201356 (1972)","journal-title":"J. ACM"},{"key":"10_CR26","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1145\/75246.75276","volume-title":"SIGCOMM 1989: Symposium proceedings on Communications architectures & protocols","author":"C.H. West","year":"1989","unstructured":"West, C.H.: Protocol validation in complex systems. In: SIGCOMM 1989: Symposium proceedings on Communications architectures & protocols, pp. 303\u2013312. ACM, New York (1989)"}],"container-title":["Lecture Notes in Computer Science","Fundamental Approaches to Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19811-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:30:42Z","timestamp":1558420242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19811-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198106","9783642198113"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19811-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}