{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T03:54:22Z","timestamp":1772078062164,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540581796","type":"print"},{"value":"9783540484691","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58179-0_49","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:24:41Z","timestamp":1330269881000},"page":"132-141","source":"Crossref","is-referenced-by-count":16,"title":["On the random walk method for protocol testing"],"prefix":"10.1007","author":[{"given":"Milena","family":"Mihail","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos H.","family":"Papadimitriou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Mathematics, Vol. 986","volume-title":"Seminaire de Probabilites XVII","author":"D. Aldous","year":"1983","unstructured":"Aldous, D., \u201cRandom Walks on finite groups and rapidly mixing Markov chains\u201d, Seminaire de Probabilites XVII, Lecture Notes in Mathematics, Vol. 986, Springer Ferlag, Berlin, 1983."},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1017\/S0269964800000267","volume":"1","author":"D. Aldous","year":"1987","unstructured":"Aldous, D., \u201cOn the Markov Chain Simulation Method for uniform combinatorial distributions and simulated annealing\u201d, Probability in Eng. and Inf. Sci. 1, 1987, pp 33\u201346.","journal-title":"Probability in Eng. and Inf. Sci."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Aleliunas, R., Karp, R.M., Lipton, J.R., Lovasz, L., and Rackoff, C., \u201cRandom walks, universal traversal sequences, and the complexity of maze problems\u201d, Proc. 20th IEEE Symp. on Foundations of Computer Science, 1979, 218\u2013233.","DOI":"10.1109\/SFCS.1979.34"},{"issue":"No.6","key":"11_CR4","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0020-0190(86)90071-2","volume":"22","author":"K.R. Apt","year":"1986","unstructured":"Apt, K.R., and Kozen, D.Z., \u201cLimits for automatic verification of finite state concurrent systems\u201d, Inf. Processing Letters, Vol. 22. No. 6, 1986, pp. 307\u2013309.","journal-title":"Inf. Processing Letters"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Broder, A.Z., \u201cHow hard is it to marry at random? Approximating the Permanent\u201d, Proc. 18th ACM Symp. on the Theory of Computing, 1986, pp. 55\u201358.","DOI":"10.1145\/12130.12136"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Broder, A.Z., \u201cGenerating random Spanning Trees\u201d, Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, pp 4422\u2013447.","DOI":"10.1109\/SFCS.1989.63516"},{"key":"11_CR7","unstructured":"Cohen, E., Mihail, M., Papadimitriou, C.H., and Tsantilas, T., \u201cTesting Protocols by Random Walk: Mixing and Cover Times\u201d, Bellcore TM ARA-4-94, 1994."},{"issue":"No.12","key":"11_CR8","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1109\/TC.1986.1676711","volume":"C-35","author":"M.C. Browne","year":"1986","unstructured":"Browne, M.C., Clarke, E.M., Dill, D.L., and Mishra, B., \u201cAutomatic verification of sequential circuits using temporal logic\u201d, IEEE Trans. on Computers, Vol. C-35, No. 12, 1986, pp. 1035\u20131043.","journal-title":"IEEE Trans. on Computers"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Emerson, E.A., and Sisla, A.P., \u201cAutomatic verification of finite state concurrent systems using temporal logic specifications: a practical approach\u201d, Proc. 10th ACM Symposium on Principles of Programming Languages, 1983.","DOI":"10.1145\/567067.567080"},{"key":"11_CR10","unstructured":"Diaconis, P., \u201cGroup Theory and Statistics\u201d, Lecture Notes from a course taught at Harvard, Spring 1982."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Dyer, M., Frieze, A., and Kannan, R., \u201cA random polynomial time algorithm for estimating volumes of convex bodies\u201d, Proc. 21st ACM Symp. on the Theory of Computing, 1989, pp 375\u2013381.","DOI":"10.1145\/73007.73043"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Feder, T., and Mihail, M., \u201cBalanced Matroids\u201d, Proc. 24th ACM Symp. on the Theory of Computing, 1992, pp. 26\u201337.","DOI":"10.1145\/129712.129716"},{"key":"11_CR13","unstructured":"Holzmann, G.J., Design and Validation of Computer Protocols, Prentice Hall Software Series, 1991."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Jerrum, M.R., and Sinclair, A., \u201cApproximating the Permanent\u201d, Proc. 20th ACM Symp. on the Theory of Computing, 1988, pp 235\u2013243.","DOI":"10.1145\/62212.62234"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Lee, D., and Yannakakis, M., \u201cOnline minimization of transition systems\u201d, Proc. 24th ACM Symp. on the Theory of Computing, 1992, pp. 264\u2013274.","DOI":"10.1145\/129712.129738"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Mihail, M., \u201cConductance and Convergence of Markov Chains, A Combinatorial Treatment of Expanders\u201d, Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989.","DOI":"10.1109\/SFCS.1989.63529"},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00283332","volume":"25","author":"J.H. Reif","year":"1988","unstructured":"Reif, J.H., and Smolka, S.A., \u201cThe complexity of reachability in distributed communicating processes\u201d, Acta Informatica, Vol. 25, 1988, pp. 333\u2013354.","journal-title":"Acta Informatica"},{"key":"11_CR18","volume-title":"Protocol Specification, Testing, and Verification, XII","author":"H. Rudin","year":"1992","unstructured":"Rudin, H., \u201cProtocol development success stories: Part 1\u201d, Protocol Specification, Testing, and Verification, XII, Elsevier Science Publishers, (North-Holland), 1992."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"West, C.H., \u201cProtocol Validation in Complex Systems\u201d, Proc. 8th ACM Symposium on Principles of Distributed Computing, 1989, pp. 303\u2013312.","DOI":"10.1145\/75246.75276"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Wolper, P., \u201cSpecifying interesting properties of programs in propositional temporal logic\u201d, Proc. 13th ACM Symposium on Principles of Programming Languages, 1986, pp. 148\u2013193.","DOI":"10.1145\/512644.512661"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Yannakakis, M., and Lee, D., \u201cTesting Finite State Machines\u201d, Proc. of the 23rd ACM Symp. on the Theory of Computing, 1991, pp. 476\u2013485.","DOI":"10.1145\/103418.103468"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58179-0_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:21:20Z","timestamp":1742595680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58179-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581796","9783540484691"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-58179-0_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}