{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:13:43Z","timestamp":1760170423878},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709510"},{"type":"electronic","value":"9783540709527"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-70952-7_22","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T12:40:01Z","timestamp":1182861601000},"page":"316-330","source":"Crossref","is-referenced-by-count":10,"title":["Parallel\u00a0Algorithms\u00a0for\u00a0Finding\u00a0SCCs in\u00a0Implicitly\u00a0Given\u00a0Graphs"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Barnat","sequence":"first","affiliation":[]},{"given":"Pavel","family":"Moravec","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"22_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0020-0190(93)90017-4","volume":"45","author":"N. Amato","year":"1993","unstructured":"Amato, N.: Improved processor bounds for parallel algorithms for weighted directed graphs. Inf. Process. Lett.\u00a045(3), 147\u2013152 (1993)","journal-title":"Inf. Process. Lett."},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_26","volume-title":"Computer Aided Verification","author":"J. Barnat","year":"2006","unstructured":"Barnat, J., Brim, L., \u010cern\u00e1, I., Moravec, P., Ro\u010dkai, P., \u0160ime\u010dek, P.: Divine \u2013 a tool for distributed verification. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, Springer, Heidelberg (2006)"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/ASE.2003.1240299","volume-title":"18th IEEE International Conference on Automated Software Engineering (ASE\u201903)","author":"J. Barnat","year":"2003","unstructured":"Barnat, J., Brim, L., Chaloupka, J.: Parallel Breadth-First Search LTL Model-Checking. In: 18th IEEE International Conference on Automated Software Engineering (ASE\u201903), Oct. 2003, pp. 106\u2013115. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"22_CR4","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Proc. Workshop on Parallel and Distributed Model Checking","author":"G. Behrmann","year":"2002","unstructured":"Behrmann, G.: A performance study of distributed timed automata reachability analysis. In: Proc. Workshop on Parallel and Distributed Model Checking. Electronic Notes in Theoretical Computer Science, vol.\u00a068, Elsevier Science Publishers, Amsterdam (2002)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/978-3-540-30494-4_25","volume-title":"Formal Methods in Computer-Aided Design","author":"L. Brim","year":"2004","unstructured":"Brim, L., \u010cern\u00e1, I., Moravec, P., \u0160im\u0161a, J.: Accepting Predecessors are Better than Back Edges in Distributed LTL Model-Checking. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol.\u00a03312, pp. 352\u2013366. Springer, Heidelberg (2004)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/3-540-60029-9_40","volume-title":"Application and Theory of Petri Nets 1995","author":"S. Caselli","year":"1995","unstructured":"Caselli, S., Conte, G., Marenzoni, P.: Parallel state space exploration for GSPN models. In: DeMichelis, G., D\u00edaz, M. (eds.) Application and Theory of Petri Nets 1995. LNCS, vol.\u00a0935, pp. 181\u2013200. Springer, Heidelberg (1995)"},{"doi-asserted-by":"crossref","unstructured":"Ciardo, G., Gluckman, J., Nicol, D.M.: Distributed State Space Generation of Discrete-State Stochastic Models. INFORMS Journal of Computing (1997)","key":"22_CR7","DOI":"10.1287\/ijoc.10.1.82"},{"unstructured":"Ciesinski, F., Baier, C.: LiQuor: A tool for Qualitative and Quantitative Linear Time analysis of Reactive Systems (2006)","key":"22_CR8"},{"key":"22_CR9","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)"},{"issue":"3","key":"22_CR10","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/0890-5401(89)90036-9","volume":"81","author":"R. Cole","year":"1989","unstructured":"Cole, R., Vishkin, U.: Faster optimal parallel prefix sums and list ranking. Inf. Comput.\u00a081(3), 334\u2013352 (1989)","journal-title":"Inf. Comput."},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-45319-9_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Fisler","year":"2001","unstructured":"Fisler, K., Fraer, R., Kamhi, G., Vardi, M.Y., Yang, Z.: Is there a best symbolic cycle-detection algorithm? In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol.\u00a02031, pp. 420\u2013434. Springer, Heidelberg (2001)"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/3-540-45591-4_68","volume-title":"Parallel and Distributed Processing","author":"L.K. Fleischer","year":"2000","unstructured":"Fleischer, L.K., Hendrickson, B., Pinar, A.: On identifying strongly connected components in parallel. In: Rolim, J.D.P. (ed.) Parallel and Distributed Processing. LNCS, vol.\u00a01800, pp. 505\u2013511. Springer, Heidelberg (2000)"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45139-0_14","volume-title":"Model Checking Software","author":"H. Garavel","year":"2001","unstructured":"Garavel, H., Mateescu, R., Smarandache, I.M.: Parallel State Space Construction for Model-Checking. In: Dwyer, M.B. (ed.) Model Checking Software. LNCS, vol.\u00a02057, pp. 200\u2013216. Springer, Heidelberg (2001)"},{"issue":"2","key":"22_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0020-0190(88)90164-0","volume":"28","author":"H. Gazit","year":"1988","unstructured":"Gazit, H., Miller, G.L.: An improved parallel algorithm that computes the bfs numbering of a directed graph. Inf. Process. Lett.\u00a028(2), 61\u201365 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"8","key":"22_CR15","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1016\/j.jpdc.2005.03.007","volume":"65","author":"W. McLendon III.","year":"2005","unstructured":"McLendon III., W., Hendrickson, B., Plimpton, S.J., Rauchwerger, L.: Finding strongly connected components in distributed graphs. J. Parallel Distrib. Comput.\u00a065(8), 901\u2013910 (2005)","journal-title":"J. Parallel Distrib. Comput."},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48234-2_3","volume-title":"Theoretical and Practical Aspects of SPIN Model Checking","author":"F. Lerda","year":"1999","unstructured":"Lerda, F., Sisto, R.: Distributed-memory model checking with SPIN. In: Dams, D.R., Gerth, R., Leue, S., Massink, M. (eds.) Theoretical and Practical Aspects of SPIN Model Checking. LNCS, vol.\u00a01680, Springer, Heidelberg (1999)"},{"unstructured":"Orzan, S.: On Distributed Verification and Verified Distribution. PhD thesis, Free University of Amsterdam (2004)","key":"22_CR17"},{"unstructured":"Orzan, S.M., van de Pol, J.C.: Detecting strongly connected components in large distributed state spaces. Technical Report SEN-E0501, CWI (2005)","key":"22_CR18"},{"issue":"5","key":"22_CR19","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(85)90024-9","volume":"20","author":"J.H. Reif","year":"1985","unstructured":"Reif, J.H.: Depth-first search is inherently sequential. Information Processing Letters\u00a020(5), 229\u2013234 (1985)","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Tarjan, R.: Depth first search and linear graph algorithms. SIAM Journal on computing, 146\u2013160 (1972)","key":"22_CR20","DOI":"10.1137\/0201010"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-63166-6_26","volume-title":"Computer Aided Verification","author":"U. Stern","year":"1997","unstructured":"Stern, U., Dill, D.L.: Parallelizing the mur\u03d5 verifier. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 256\u2013267. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods: Applications and Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70952-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T20:34:48Z","timestamp":1556570088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70952-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540709510","9783540709527"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70952-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}