Skip to main content
SpringerLink
Log in

A New and Fast Variant of the Strict Strong Coloring Based Graph Distribution Algorithm

  • Chapter
  • First Online:
Book cover Software Engineering Research, Management and Applications

Part of the book series: Studies in Computational Intelligence ((SCI,volume 654))

  • 598 Accesses

Abstract

We consider the state space explosion problem which is a fundamental obstacle in formal verification of critical systems. In this paper, we propose a fast algorithm for distributing state spaces on a network of workstations. Our solution is an improvement version of SSCGDA algorithm (for Strict Strong Coloring based Graph Distribution Algorithm) which introduced the coloring concept and dominance relation in graphs for finding the good distribution of given graphs [1]. We report on a thorough experimental study to evaluate the performance of this new algorithm. The quality of the proposed algorithm is illustrated by comparison with existing algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 139.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Guidoum, N., Bensouyad, M., & Saïdouni, D. E. (2013). The strict strong coloring based graph distribution algorithm. International Journal of Applied Metaheuristic Computing, 4, 50–66.

    Article  Google Scholar 

  2. Valmari, A. (1998). The state explosion problem. In Lectures on Petri Nets I: Basic Models: Of Lecture Notes in Computer Science (vol. 1491, pp. 429–528). London, UK.

    Google Scholar 

  3. Clarke, E., Grumberg, O., & Peled, D. (1999). Model checking. Cambridge, MA: The MIT Press.

    Google Scholar 

  4. Bérard, B., Bidoit, M., Finkel, A., Laroussinie, F., Petit, A., Petrucci, L., et al. (2001). Systems and software verification: Model-checking techniques and tools. Springer.

    Google Scholar 

  5. Bixby, R., Kennedy, K., & Kremer, U. (1993). Automatic data layout using 0–1 integer programming, Houston, TX, United State: Rice University, Center for Research on Parallel Computation, Tech. Rep. CRPC-TR93349-S.

    Google Scholar 

  6. Bouneb, Z., & Saïdouni, D. E. (2009). Parallel state space construction for a model checking based on maximality semantics. In Proceedings of the 2nd Mediterranean Conference on Intelligent Systems and Automation (vol. 1107, pp. 7–12).

    Google Scholar 

  7. Orzan, S., van de Pol, S., & Valero Espada, M. (2005). A state space distribution policy based on abstract interpretation. Electronic Notes in Theoretical Computer Science, 128(3), 35–45.

    Article  MATH  Google Scholar 

  8. Stanton, I., & Kliot, G. (2011). Streaming graph partitioning for large distributed graphs (Tech. Rep. MSR-TR-2011-121). Microsoft Research Lab.

    Google Scholar 

  9. Saad, R., Dal Zilio, S., Berthomieu, B,. & Vernadat, F. (2009). Enumerative parallel and distributed state space construction. In Ecoled’Eté Temps Réel (ETR’09), Paris, France.

    Google Scholar 

  10. Bensouyad, M., Bouzenada, M., Guidoum, N., & Saïdouni, D. E. (2014). A generalized graph strict strong coloring algorithm: Application on graph distribution. Contemporary Advancements in Information Technology Development in Dynamic Environments, 181.

    Google Scholar 

  11. Klotz, W. (2002). Graph coloring algorithms. Clausthal, Germany: Clausthal University of Technology, Tech. Rep. No.

    Google Scholar 

  12. Dharwadker, A. (2006). The independent set algorithm. Institute of Mathematics. Retrieved from http://www.dharwadker.org/independent_set/.

  13. ZverovichI, E. (2006). A new kind of graph coloring. Journal of Algorithms, 58(2), 118–133.

    Google Scholar 

  14. Haddad, M., & Kheddouci, H. (2009). A strict strong coloring of trees. Information Processing Letters, 109(18), 1047–1054.

    Article  MathSciNet  MATH  Google Scholar 

  15. Bouzenada, M., Bensouyad, M., Guidoum, N., Reghioua, A., & Saïdouni, D. E. (2012). A generalized graph strict strong coloring algorithm. International Journal of Applied Metaheuristic Computing (IJAMC), 3(1), 24–33.

    Google Scholar 

  16. NetLogo Models Library: Sample Models/Computer Science Standards, ccl.northwestern.edu. Retrieved from http://ccl.northwestern.edu/netlogo/models/DiningPhilosophers.

  17. Model Checking Contest, “Peterson” model, sumo.lip6.fr. Retrieved from http://sumo.lip6.fr/Peterson_model.html.

  18. Dijkstra, E. W. (1965). Solution of a problem in concurrent programming control. CACM, 8(9), 569. doi:10.1145/365559.365617.

    Article  Google Scholar 

  19. Grubbs, F. E. (1969). Procedures for detecting outlying observations in samples. Technometrics, 11(1), 1–21.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MISC Laboratory, A. Mehri, Constantine 2 University, Constantine, Algeria

    Nousseiba Guidoum, Meriem Bensouyad & Djamel-Eddine Saïdouni

Authors
  1. Nousseiba Guidoum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Meriem Bensouyad
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Djamel-Eddine Saïdouni
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nousseiba Guidoum .

Editor information

Editors and Affiliations

  1. Software Engineering & Information, Central Michigan University, MOUNT PLEASANT, USA

    Roger Lee

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Guidoum, N., Bensouyad, M., Saïdouni, DE. (2016). A New and Fast Variant of the Strict Strong Coloring Based Graph Distribution Algorithm. In: Lee, R. (eds) Software Engineering Research, Management and Applications. Studies in Computational Intelligence, vol 654. Springer, Cham. https://doi.org/10.1007/978-3-319-33903-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-33903-0_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-33902-3

  • Online ISBN: 978-3-319-33903-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation