Semi-dynamic breadth-first search in digraphs

By Franciosa P.G.   Frigioni D.   Giaccio R.  

Theoretical Computer Science, Vol. 250, Iss. 1, 2001-01 ,pp. : 201-217

Elsevier

Access to resources Recommend Favorite

Distributed model-checking and counterexample search for CTL logic

By Boukala Mohand Cherif  

International Journal of Critical Computer-Based Systems, Vol. 3, Iss. 1-2, 2012-01 ,pp. : 44-59

Inderscience Publishers

Access to resources Recommend Favorite

基于广度优先遍历的关键路线生成树算法 A Critical Path Spanning Tree Algorithm Based on Breadth-First Traversal

By 付冬梅   练丁榑  

Computer Science and Application, Vol. 02, Iss. 02, 2012-06 ,pp. : 51-56

汉斯出版社

Access to resources Recommend Favorite

Efficient distributed SAT and SAT-based distributed Bounded Model Checking

By Ganai Malay   Gupta Aarti   Yang Zijiang   Ashar Pranav  

International Journal on Software Tools for Technology Transfer, Vol. 8, Iss. 4-5, 2006-08 ,pp. : 387-396

Springer Publishing Company

Access to resources Recommend Favorite

Dealing with practical limitations of distributed timed model checking for timed automata

By Braberman V.   Olivero A.   Schapachnik F.  

Formal Methods in System Design, Vol. 29, Iss. 2, 2006-09 ,pp. : 197-214

Springer Publishing Company

Access to resources Recommend Favorite