Skip to main content
SpringerLink
Log in

On the Usage of Network Visualization for Multiagent System Verification

  • Chapter
  • First Online:
Book cover Online Social Media Analysis and Visualization

Part of the book series: Lecture Notes in Social Networks ((LNSN))

Abstract

Multiagent Systems (MAS) consists of many software agents that interact to each other to perform their actions and achieve system goals. Due to the growing demand of Distributed Software Systems (DSS) and MAS as a branch of DSS, the verification of these systems has taken a special attention. The verification of these systems is required because MAS and DSS are large scale systems, where a failure can result in a huge amount of cost or damage. One major field is verification of MAS designs to prevent cost of fixing problems after implementation and deployment. The agents and interactions among them form a network of agents. This network can be used for verification of MAS from different perspectives and by various techniques. Visualizing agents’ networks can lead to detect a special type of unexpected behavior in MAS referred to as emergent behaviors and implied scenarios. These unexpected behaviors are more probable in large scale systems because the functionality and control are distributed and there is lack of central controller in MAS and DSS. Consequently, a new scenario can be implied to the system at run time which may not be an acceptable behavior in the system. In this article, visualization techniques are applied to form three different networks extracted from the designs of MAS for this purpose. These networks are used to detect emergent behaviors and implied scenarios in the system. The methodology, system architecture, data preparation and visualization, required network definitions, and results are verified through case studies.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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. Wooldridge M, Fisher M, Huget M-H, Parsons S (2002) Model checking multi-agent systems with MABLE. In: Proceedings of the first international joint conference on autonomous agents and multiagent systems: part 2. ACM: Bologna, pp 952–959

    Google Scholar 

  2. Bordini R, Fisher M, Pardavila C, Visser W, Wooldridge M (2003) Model checking multi-agent programs with CASP. In: Hunt W Jr, Somenzi F (eds) Computer aided verification. Springer, Berlin, pp 110–113

    Google Scholar 

  3. Moshirpour M, Mousavi A, Far BH (2010) A technique and a tool to detect emergent behavior of distributed systems using scenario-based specifications. In: 22nd IEEE international conference on tools with artificial intelligence (ICTAI)

    Google Scholar 

  4. Mousavi A (2009) Inference of emergent behaviours of scenario-based specifications. In: Department of electrical and computer engineering. University of Calgary, Calgary, p 160

    Google Scholar 

  5. Broy M (2011) Seamless method- and model-based software and systems engineering. The future of software engineering. Springer, Berlin, pp 33–47

    Chapter  Google Scholar 

  6. Alur R, Etessami K, Yannakakis M (2003) Inference of message sequence charts. IEEE Trans Softw Eng 29(7):623–633

    Article  Google Scholar 

  7. Chakraborty J, D’Souza D, Narayan Kumar K (2010) Analysing message sequence graph specifications. In: Margaria T, Steffen B (eds) Leveraging applications of formal methods, verification, and validation. Springer, Berlin, pp 549–563

    Chapter  Google Scholar 

  8. Uchitel S (2003) Incremental elaboration of scenario-based specifications and behaviour models using implied scenarios. In: Department of computing. Imperial College of Science, Technology and Medicine, University of London, p 173

    Google Scholar 

  9. Chaki S, Clarke E, Grumberg O, Ouaknine J, Sharygina N, Touili T, Veith H (2005) State/event software verification for branching-time specifications. In: Romijn J, Smith G, Pol J (eds) Integrated formal methods. Springer, Berlin, pp 53–69

    Chapter  Google Scholar 

  10. Sanchez E, Squillero G, Tonda A (2012) Automatic software verification. Industrial applications of evolutionary algorithms. Springer, Berlin, pp 17–30

    Chapter  Google Scholar 

  11. Ammar K, Pullum L, Taylor B (2006) Augmentation of current verification and validation practices. Methods and procedures for the verification and validation of artificial neural networks. Springer, New York, pp 13–31

    Chapter  Google Scholar 

  12. Quan TT, Hoang DLN, Nguyen BT, Nguyen AN, Tran QD, Nguyen PH, Bui TH, Do AT, Huynh LV, Doan NT, Huynh NT, Nguyen TD, Nguyen TT, Nguyen VH et al (2010) MAFSE: a model-based framework for software verification, pp 150–156

    Google Scholar 

  13. Verhulst E, Jong G, Mezhuyev V (2008) An industrial case: pitfalls and benefits of applying formal methods to the development of a network-centric RTOS. In: Cuellar J, Maibaum T, Sere K (eds) FM 2008: formal methods. Springer, Berlin, pp 411–418

    Chapter  Google Scholar 

  14. Briand LC (2010) Software verification—a scalable, model-driven, empirically grounded approach. Simula Research Laboratory. Springer, Berlin, pp 415–442

    Chapter  Google Scholar 

  15. Knight J (1998) Challenges in the utilization of formal methods. In: Ravn A, Rischel H (eds) Formal techniques in real-time and fault-tolerant systems. Springer, Berlin, pp 1–17

    Google Scholar 

  16. Kneuper R (1997) Limits of formal methods. Form Asp Comput 9(4):379–394

    Article  Google Scholar 

  17. Song I-G, Sang-Uk J, Ah-Rim H, Doo-Hwan B (2011) An approach to identifying causes of implied scenarios using unenforceable orders. Inf Softw Technol 53(6):666–681

    Article  Google Scholar 

  18. Bontemps Y, Schobbens P-Y (2007) The computational complexity of scenario-based agent verification and design. J Appl Log 5(2):252–276

    Article  MATH  MathSciNet  Google Scholar 

  19. Fard FH, Far BH (2013) Detection and verification of a new type of emergent behavior in multiagent systems. In: 17th international conference on intelligent engineering systems (INES)

    Google Scholar 

  20. Fard FH (2013) Detecting and fixing emergent behaviors in distributed software systems using a message content independent method. In: Press in 28th IEEE/ACM international conference on automated software engineering (ASE), Doctoral symposium. IEEE

    Google Scholar 

  21. Fard FH, Far BH (2012) A method for detecting agents that will not cause emergent behavior in agent based systems—a case study in agent based auction systems. In: 2012 IEEE 13th international conference on information reuse and integration (IRI)

    Google Scholar 

  22. Uchitel S, Kramer J, Magee J (2002) Implied scenario detection in the presence of behaviour constraints. Electron Notes Theor Comput Sci 65(7):65–84

    Article  Google Scholar 

  23. Carrol JM (1999) Five reasons for scenario-based design. In: Proceedings of the 32nd annual Hawaii international conference on system sciences, HICSS-32

    Google Scholar 

  24. Lunjin L, Dae-Kyoo K (2011) Required behavior of sequence diagrams: semantics and refinement. In: 2011 16th IEEE international conference on engineering of complex computer systems (ICECCS)

    Google Scholar 

  25. Genest B, Muscholl A (2005) Message sequence charts: a survey. In: Fifth international conference on application of concurrency to system design, ACSD 2005

    Google Scholar 

  26. Mani N, Garousi V, Far BH (2008) Monitoring multi-agent systems for deadlock detection based on UML models. In: Canadian conference on electrical and computer engineering, CCECE 2008

    Google Scholar 

  27. Genest B, Muscholl A, Peled D (2004) Message sequence charts. In: Desel J, Reisig W, Rozenberg G (eds) Lectures on concurrency and petri nets. Springer, Berlin, pp 103–121

    Google Scholar 

  28. Broy M (2000) The essence of message sequence charts. In: Proceedings of the international symposium on multimedia software engineering 2000

    Google Scholar 

  29. Krüger IH (2000) Distributed system design with message sequence charts. In: Institute of computer science 2000, Technical University of Munich, p 386

    Google Scholar 

  30. Whittle J, Schumann J (2006) Scenario-based engineering of multi-agent systems in agent technology from a formal perspective. In: Rouff C et al (eds) Springer, London, pp 159–189

    Google Scholar 

  31. UNION-, TSSOI-IT, SERIES Z (2004) Languages and general software aspects for telecommunication systems—formal description techniques (FDT)—message sequence chart, ITU-T Recommendation Z.120, p 136

    Google Scholar 

  32. Uchitel S, Kramer J, Magee J (2001) Detecting implied scenarios in message sequence chart specifications. In: Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on foundations of software engineering 2001. ACM, Vienna, pp 74–82

    Google Scholar 

  33. Alur R, Yannakakis M (1999) Model checking of message sequence charts. In: Baeten JM, Mauw S (eds) Concurrency theory CONCUR’99. Springer, Berlin, pp 114–129

    Google Scholar 

  34. Moshirpour M (2011) Model-based detection of emergent behavior in distributed and multi-agent systems from component level perspective. In: Department of electrical and computer engineering 2011, University of Calgary, Calgary, p 109

    Google Scholar 

  35. Muccini H (2003) Detecting implied scenarios analyzing non-local branching choices. In: Pezzè M (ed) Fundamental approaches to software engineering. Springer, Berlin, pp 372–386

    Google Scholar 

  36. Sousa FCd, Mendonca NC, Uchitel S, Kramer J (2007) Detecting implied scenarios from execution traces. In: Proceedings of the 14th working conference on reverse engineering 2007. IEEE Computer Society, pp 50–59

    Google Scholar 

  37. Uchitel S, Kramer J, Magee J (2003) Synthesis of behavioral models from scenarios. IEEE Trans Softw Eng 29(2):99–115

    Article  Google Scholar 

  38. Adsul B, Mukund M, Kumar KN, Narayanan V (2005) Causal closure for MSC languages. In: Sarukkai S, Sen S (eds) FSTTCS 2005: foundations of software technology and theoretical computer science. Springer, Berlin, pp 335–347

    Google Scholar 

  39. Bhateja P, Gastin P, Mukund M, Kumar KN (2007) Local testing of message sequence charts is difficult, in fundamentals of computation theory. In: Csuhaj-Varjú E, Ésik Z (eds) Springer, Berlin, pp 76–87

    Google Scholar 

  40. Alur R, Etessami K, Yannakakis M (2005) Realizability and verification of MSC graphs. Theor Comput Sci 331(1):97–114

    Article  MATH  MathSciNet  Google Scholar 

  41. Alur R, Yannakakis M (2001) Model checking of hierarchical state machines. ACM Trans Program Lang Syst 23(3):273–303

    Article  Google Scholar 

  42. Schumann J, Whittle J (2001) Automatic synthesis of agent designs in UML. In: Rash J et al (eds) Formal approaches to agent-based systems. Springer, Berlin, pp 148–162

    Google Scholar 

  43. Whittle J, Kwan R, Saboo J (2005) From scenarios to code: an air traffic control case study. Softw Syst Model 4(1):71–93

    Article  Google Scholar 

  44. Whittle J, Schumann J (2000) Generating statechart designs from scenarios. In: Proceedings of the 22nd international conference on software engineering 2000. ACM, Limerick, pp 314–323

    Google Scholar 

  45. Ben-Abdallah H, Leue S (1998) MESA: Support for scenario-based design of concurrent systems. In: Steffen B (ed) Tools and algorithms for the construction and analysis of systems. Springer, Berlin, pp 118–135

    Google Scholar 

  46. Ben-Abdallah H, Leue S (1997) Syntactic detection of process divergence and non-local choice in message sequence charts. In: Brinksma E (ed) Tools and algorithms for the construction and analysis of systems. Springer, Berlin, pp 259–274

    Google Scholar 

  47. Song I-G, Jeon SU, Bae DH (2009) A graph based approach to detecting causes of implied scenarios under the asynchronous and synchronous communication styles. In: Proceedings of the 16th Asia-Pacific software engineering conference 2009. IEEE Computer Society, pp 53–60

    Google Scholar 

  48. Uchitel S, Kramer J (2001) A workbench for synthesising behaviour models from scenarios. In: Proceedings of the 23rd international conference on software engineering 2001. IEEE Computer Society, Toronto, Ontario, pp 188–197

    Google Scholar 

  49. Letier E, Kramer J, Magee J, Uchitel S (2008) Deriving event-based transition systems from goal-oriented requirements models. Autom Softw Eng 15(2):175–206

    Article  Google Scholar 

  50. Letier E, Kramer J, Magee J, Uchitel S (2005) Monitoring and control in scenario-based requirements analysis. In: Proceedings of the 27th international conference on software engineering 2005. ACM, St. Louis, pp 382–391

    Google Scholar 

  51. Magee J, Pryce N, Giannakopoulou D, Kramer J (2000) Graphical animation of behavior models. In Proceedings of the 22nd international conference on software engineering 2000, ACM, Limerick, pp 499–508

    Google Scholar 

  52. Henriksen J, Mukund M, Kumar KN, Thiagarajan PS (2000) Regular collections of message sequence charts. In: Nielsen M, Rovan B (eds) Mathematical foundations of computer science 2000. Springer, Berlin, pp 405–414

    Google Scholar 

  53. Mukund M, Kumar KN, Sohoni M (2000) Synthesizing distributed finite-state systems from MSCs. In: Palamidessi C (ed) CONCUR 2000—concurrency theory. Springer, Berlin, pp 521–535

    Google Scholar 

  54. Aggarwal C (2011) An introduction to social network data analytics. In: Aggarwal CC (ed) Social network data analytics. Springer, New York, pp 1–15

    Google Scholar 

  55. Sabater J, Sierra C (2002) Reputation and social network analysis in multi-agent systems. In: Proceedings of the first international joint conference on autonomous agents and multiagent systems: part 1. ACM, Bologna, pp 475–482

    Google Scholar 

  56. Hanneman RA, Riddle M (2005) Introduction to social network methods. http://faculty.ucr.edu/~ hanneman/nettext/C6_Working_with_data.html

  57. Mislove AE (2009) Online social networks: measurement, analysis, and applications to distributed information systems. Rice University

    Google Scholar 

  58. Song HH, Cho TW, Dave V, Zhang Y, Qiuet L (2009) Scalable proximity estimation and link prediction in online social networks. In: Proceedings of the 9th ACM SIGCOMM conference on internet measurement conference 2009. ACM, Chicago, pp 322–335

    Google Scholar 

  59. Sun J, Tang J (2011) A survey of models and algorithms for social influence analysis. In: Aggarwal CC (ed) Social network data analytics. Springer, New York, pp 177–214

    Google Scholar 

  60. Gutiérrez C, García-Magariño I, Fuentes-Fernández R (2011) Detection of undesirable communication patterns in multi-agent systems. Eng Appl Artif Intell 24(1):103–116

    Article  Google Scholar 

  61. Gutierrez C, García-Magariño I (2011) Revealing bullying patterns in multi-agent systems. J Syst Softw 84(9):1563–1575

    Article  Google Scholar 

  62. Gutiérez C, García-Magariño I, Gómez-Sanz J (2009) Evaluation of multi-agent system communication in INGENIAS. In: Cabestany J et al (eds) Bio-Inspired systems: computational and ambient intelligence. Springer, Berlin, pp 619–626

    Google Scholar 

  63. Botía J, Hernansáez J, Gómez-Skarmeta A (2007) On the application of clustering techniques to support debugging large-scale multi-agent systems. In: Bordini R et al (eds) Programming multi-agent systems. Springer, Berlin, pp 217–227

    Google Scholar 

  64. Botía J, Gómez-Sanz J, Pavón J (2006) Intelligent data analysis for the verification of multi-agent systems interactions. In: Corchado E et al (eds) Intelligent data engineering and automated learning—IDEAL’06. Springer, Berlin, pp 1207–1214

    Google Scholar 

Download references

Acknowledgments

This research is supported by a grant from Izaak Walton Killam Memorial Scholarship, Alberta Innovates Technology Futures and partially from Natural Sciences and Engineering Research Council of Canada.

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Calgary, Calgary, AB, Canada

    Fatemeh Hendijani Fard & Behrouz H. Far

Authors
  1. Fatemeh Hendijani Fard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Behrouz H. Far
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Behrouz H. Far .

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, Calgary, Alberta, Canada

    Jalal Kawash

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Hendijani Fard, F., Far, B.H. (2014). On the Usage of Network Visualization for Multiagent System Verification. In: Kawash, J. (eds) Online Social Media Analysis and Visualization. Lecture Notes in Social Networks. Springer, Cham. https://doi.org/10.1007/978-3-319-13590-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13590-8_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13589-2

  • Online ISBN: 978-3-319-13590-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation