Skip to main content
SpringerLink
Log in

Formal Modeling, Verification, and Analysis of a Distributed Task Execution Algorithm

  • Conference paper
  • First Online:
Advanced Information Networking and Applications (AINA 2021)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 225))

Abstract

Task execution in a dynamic environment is a challenging and important problem in multi-robot systems. In such an environment, the arrival time, location of a task, states and availability of robots are not known in advance. Recently a distributed algorithm for task execution in such an environment has been suggested. The distributed algorithm is supposed to be run on different components (robots) of the distributed system (multi-robot system) in an asynchronous model. It needs to be formally proved or verified that the algorithm behaves as expected. In this paper, formal modeling, verification, and analysis of the distributed algorithm are carried out. SPIN model checker is used for modeling and verification of the algorithm. We identify some interesting safety and liveness properties of the algorithm and perform extensive simulations of the algorithm. The verification results ascertain that the behavior of the algorithm is as expected.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Nath, A., Arun, A.R., Niyogi, R.: An approach for task execution in dynamic multirobot environment. In: Australasian Joint Conference on Artificial Intelligence, pp. 71–76 (2018)

    Google Scholar 

  2. Holzmann, G.J.: The model checker SPIN. IEEE Trans. Softw. Eng. 23(5), 279–295 (1997)

    Google Scholar 

  3. Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. Int. J. Softw. Tools Technol Transf. 1(1–2), 134–152 (1997)

    Google Scholar 

  4. Lomuscio, A., Qu, H., and Raimondi, F. MCMAS: a model checker for the verification of multi-agent systems. In: International Conference on Computer Aided Verification, 2009, pp. 682–688. Springer, Heidelberg. https://doi.org/10.1007/978-3-642-02658-4_55

  5. Kwiatkowska, M., Norman, G., Parker, D.: PRISM: probabilistic symbolic model checker. In: International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, 2002, pp. 200–204. Springer, Heidelberg. https://doi.org/10.1007/3-540-46029-2_13

  6. Tkachuk, O., Dwyer, M.B.: Environment generation for validating event-driven software using model checking. IET Softw. 4(3), 194–209 (2002)

    Article  Google Scholar 

  7. Abdallah, S., Lesser, V.: Organization-based cooperative coalition formation. In: Proceedings IEEE/WIC/ACM International Conference on Intelligent Agent Technology, pp. 162–168 (2004)

    Google Scholar 

  8. Coviello, L., Franceschetti, M.: Distributed team formation in multi-agent systems: stability and approximation. In: 51st IEEE Conference on Decision and Control (CDC), pp. 2755–2760 (2012)

    Google Scholar 

  9. Tośić, P.T., Agha, G.A.: Maximal clique based distributed coalition formation for task allocation in large-scale multi-agent systems. In: International Workshop on Massively Multiagent Systems, pp. 104–120. Springer, Heidelberg (2004). https://doi.org/10.1007/11512073_8

  10. Wooldridge, M.: An automata-theoretic approach to multiagent planning. In: Proceedings of the First European Workshop on Multiagent Systems, Oxford University, pp. 1–15 (2003)

    Google Scholar 

  11. Clarke Jr, E.M., Grumberg, O., Kroening, D., Peled, D., Veith, H.: Model Checking. MIT press, Cambridge (2018)

    Google Scholar 

  12. Baier, C., Katoen, J.P.: Principles of Model Checking. MIT press, Cambridge (2008)

    Google Scholar 

  13. Hoare, C.A.R.: Communicating sequential processes. The origin of concurrent programming, pp. 413–443 (1978)

    Google Scholar 

Download references

Acknowledgment

The authors thank the anonymous referees for their valuable comments that were helpful for improving the paper. The second author was in part supported by a research grant from Google.

Author information

Authors and Affiliations

  1. Sant Longowal Institute of Engineering and Technology, Deemed University, Longowal, India

    Amar Nath

  2. Indian Institute of Technology Roorkee, Roorkee, India

    Rajdeep Niyogi

Authors
  1. Amar Nath
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajdeep Niyogi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Amar Nath .

Editor information

Editors and Affiliations

  1. Department of Information and Communication Engineering, Fukuoka Institute of Technology, Fukuoka, Japan

    Leonard Barolli

  2. Department of Computer Science, Ryerson University, Toronto, ON, Canada

    Isaac Woungang

  3. Faculty of Business Administration, Rissho University, Tokyo, Japan

    Tomoya Enokido

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nath, A., Niyogi, R. (2021). Formal Modeling, Verification, and Analysis of a Distributed Task Execution Algorithm. In: Barolli, L., Woungang, I., Enokido, T. (eds) Advanced Information Networking and Applications. AINA 2021. Lecture Notes in Networks and Systems, vol 225. Springer, Cham. https://doi.org/10.1007/978-3-030-75100-5_32

Download citation

Publish with us

Policies and ethics

Search

Navigation