Deductive verification of simple foraging robotic behaviours

International Journal of Intelligent Computing and Cybernetics

Volumn 2, Issue 4, 2009, Pages 604-643

  Behdenna, Abdelkader ^a   Dixon, Clare ^b   Fisher, Michael ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Control applications; Control technology; Modeling; Robotics

Indexed keywords

ABSTRACTING; AUTOMATION; COMPUTER CIRCUITS; FORMAL LANGUAGES; MODELS; ROBOTICS; ROBOTS; TEMPORAL LOGIC;

AUTOMATED VERIFICATION; CONTROL APPLICATIONS; CONTROL TECHNOLOGIES; CURRENT CAPABILITY; DEDUCTIVE VERIFICATION; DESIGN/METHODOLOGY/APPROACH; FIRST-ORDER TEMPORAL LOGIC; LOGICAL SPECIFICATIONS;

MACHINE DESIGN;

EID: 78549292530     PISSN: 1756378X     EISSN: 17563798     Source Type: Journal    
DOI: 10.1108/17563780911005818     Document Type: Article

References (45)

1. Abate, P. and Goré, R. (2003), “The tableaux work bench”, Proceedings of International Workshop on Automated Reasoning with Analytic Tableaux and Related Methods (Tableaux), Aix-en-Proxence, Lecture Notes in Artificial Intelligence, Vol. 2796, pp. 230-6.
2. Balsiger, P., Heuerding, A. and Schwendimann, S. (1998), “Logics workbench 1.0”, Proceedings of International Workshop on Automated Reasoning with Analytic Tableaux and Related Methods (Tableaux), Lecture Notes in Computer Science, Springer, Oisterwijk, Vol. 1397, p. 35.
3. Beni, G. (2005), “From swarm intelligence to swarm robotics”, Proceedings of International Workshop on Swarm Robotics (SAB), Revised Selected Papers, Lecture Notes in Computer Science, Vol. 3342, Springer, Berlin, pp. 1-9.
4. Bonabeau, E., Dorigo, M. and Theraulaz, G. (1999), Swarm Intelligence: From Natural to Artificial Systems, Oxford University Press, New York, NY.
5. Chen, D. (2005), “A simulation environment for swarm robotic system based on temporal logic specifications”, Master's thesis, University of the West of England, Bristol.
6. Cimatti, A., Clarke, E.M., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R. and Tacchella, A. (2002), “NuSMV 2: an opensource tool for symbolic model checking”, Proceedings of 14th International Conference on Computer-aided Verification (CAV), Lecture Notes in Computer Science, Vol. 2404, Springer, Berlin, pp. 359-64.
7. Clarke, E., Grumberg, O. and Peled, D.A. (2000), Model Checking, MIT Press, Cambridge, MA.
8. Dixon, C., Fisher, M. and Konev, B. (2007a), “Temporal logic with capacity constraints”, Proceedings of 6th International Symposium on Frontiers of Combining Systems (FroCos), Lecture Notes in Computer Science, Vol. 4720, Springer, Berlin, pp. 163-77.
9. Dixon, C., Fisher, M. and Konev, B. (2007b), “Tractable temporal reasoning”, Proceedings of 20th International Joint Conference on Artificial Intelligence (IJCAI), AAAI Press, Portland, OR, pp. 318-23.
10. Dixon, C., Fisher, M., Konev, B. and Lisitsa, A. (2008), “Practical first-order temporal reasoning”, Proceedings of 15th International Symposium on Temporal Representation and Reasoning (TIME), IEEE Press, Los Alamitos, CA.
11. Emerson, E.A. (1990), “Temporal and modal logic”, in van Leeuwen, J. (Ed.), Handbook of Theoretical Computer Science, Elsevier, Amsterdam, pp. 996-1072.
12. Fainekos, G., Kress-Gazit, H. and Pappas, G. (2005), “Temporal logic motion planning for mobile robots”, Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), IEEE, Barcelona, Spain, pp. 2020-5.
13. Fisher, M. (2007), “Temporal representation and reasoning”, in van Harmelen, F., Porter, B. and Lifschitz, V. (Eds), Handbook of Knowledge Representation, Foundations of Artificial Intelligence, Vol. 2, Elsevier, Amsterdam.
14. Fisher, M., Dixon, C. and Peim, M. (2001), “Clausal temporal resolution”, ACM Transactions on Computational Logic, Vol. 2 No. 1, pp. 12-56.
15. Fisher, M., Konev, B. and Lisitsa, A. (2006), “Practical infinite-state verification with temporal reasoning”, Verification of Infinite State Systems and Security, NATO Security through Science Series: Information and Communication, Vol. 1, IOS Press, Amsterdam.
16. Fisher, M., Konev, B. and Lisitsa, A. (2009), “Temporal verification of fault-tolerant protocols”, Methods, Models and Tools for Fault Tolerance, Lecture Notes in Computer Science, Vol. 5454, Springer, Berlin, pp. 44-56.
17. Gabbay, D., Pnueli, A., Shelah, S. and Stavi, J. (1980), “The temporal analysis of fairness”, Proceedings of 7th ACM Symposium on the Principles of Programming Languages, Las Vegas, NV, ACM, New York, NY, pp. 163-73.
18. Gordon-Spears, D. and Kiriakidis, K. (2004), “Reconfigurable robot teams: modeling and supervisory control”, IEEE Transactions on Control Systems Technology, Vol. 12 No. 5, pp. 763-9.
19. Harper, C. and Winfield, A. (2006), “A methodology for provably stable behaviour-based intelligent control”, Robotics and Autonomous Systems, Vol. 54 No. 1, pp. 52-73.
20. Hodkinson, I., Wolter, F. and Zakharyashev, M. (2000), “Decidable fragments of first-order temporal logics”, Annals of Pure and Applied Logic, Vol. 106 Nos 1-3, pp. 85-134.
21. Hodkinson, I., Kontchakov, R., Kurucz, A., Wolter, F. and Zakharyaschev, M. (2003), “On the computational complexity of decidable fragments of first-order linear temporal logics”, Proceedings of TIME-ICTL 2003, IEEE Press, Los Alamitos, CA.
22. Holzmann, G.J. (1997), “The model checker spin”, IEEE Transactions on Software Engineering, Vol. 23 No. 5, pp. 279-95, (special issue on Formal Methods in Software Practice).
23. Hustadt, U. and Konev, B. (2003), “TRP++2.0: a temporal resolution prover”, Proceedings of 19th International Conference on Automated Deduction (CADE), Lecture Notes in Artificial Intelligence, Vol. 2741, Springer, Berlin, pp. 274-8.
24. Hustadt, U., Konev, B., Riazanov, A. and Voronkov, A. (2004), “TeMP: a temporal monodic prover”, in Basin, D.A. and Rusinowitch, M. (Eds), Proceedings of the Second International Joint Conference on Automated Reasoning (IJCAR 2004), Lecture Notes in Artificial Intelligence, Vol. 3097, Springer, Berlin, pp. 326-30.
25. Janssen, G. (1999), “Logics for digital circuit verification: theory, algorithms, and applications”, PhD thesis, Eindhoven University of Technology, Eindhoven.
26. Kloetzer, M. and Belta, C. (2007), “Temporal logic planning and control of robotic swarms by hierarchical abstractions”, IEEE Transactions on Robotics, Vol. 23, pp. 320-30.
27. Konev, B., Degtyarev, A., Dixon, C., Fisher, M. and Hustadt, U. (2005), “Mechanising first-order temporal resolution”, Information and Computation, Vol. 199 Nos 1-2, pp. 55-86.
28. Kontchakov, R., Lutz, C., Wolter, F. and Zakharyaschev, M. (2004), “Temporalizing tableaux”, Studia Logica, Vol. 76, pp. 91-134.
29. Lerman, K., Martinoli, A. and Galstyan, A. (2005), “A review of probabilistic macroscopic models for swarm robotic systems”, Swarm Robotics, Lecture Notes in Computer Science, Vol. 3342, Springer, Berlin, pp. 143-52.
30. Liu, W., Winfield, A.F.T., Sa, J., Chen, J. and Dou, L. (2007), “Strategies for energy optimisation in a swarm of foraging robots”, Proceedings of 2nd International Workshop on Swarm Robotics (SAB), Lecture Notes in Computer Science, Vol. 4433, Springer, Berlin, pp. 14-26.
31. Ludwig, M. and Hustadt, U. (2009/2010), “Implementing a fair monodic temporal prover”, AI Communications (in press).
32. Martinoli, A., Easton, K. and Agassounon, W. (2004), “Modeling swarm robotic systems: a case study in collaborative distributed manipulation”, International Journal of Robotics Research, Vol. 23 No. 4, pp. 415-36.
33. Nembrini, J., Winfield, A.F.T. and Melhuish, C. (2002), “Minimalist coherent swarming of wireless connected autonomous mobile robots”, Proceedings of 7th International Conference on Simulation of Adaptive Behavior (ICSAB), MIT Press, Cambridge, MA, pp. 373-82.
34. Pnueli, A. (1981), “The temporal semantics of concurrent programs”, Theoretical Computer Science, Vol. 13, pp. 45-60.
35. Rouff, C.A., Hinchey, M.G., Pena, J. and Ruiz-Cortes, A. (2007), “Using formal methods and agent-oriented software engineering for modeling NASA swarm-based systems”, Proceedings of International Swarm Intelligence Symposium (SIS), IEEE Press, Los Alamitos, CA, pp. 348-55.
36. Sahin, E. and Winfield, A.F.T. (2008), “Special issue on swarm robotics”, Swarm Intelligence, Vol. 2 Nos 2-4, pp. 69-72.
37. Schwendimann, S. (1998), “A new one-pass tableau calculus for PLTL”, Proceedings of International Workshop on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX), Lecture Notes in Artificial Intelligence, Vol. 1397, Springer, Berlin, pp. 277-91.
38. Sistla, A.P. and Clarke, E.M. (1985), “Complexity of propositional linear temporal logics”, Journal of the ACM, Vol. 32 No. 3, pp. 733-49.
39. Sistla, A.P., Vardi, M. and Wolper, P. (1987), “The complementation problem for Büchi automata with applications to temporal logic”, Theoretical Computer Science, Vol. 49, pp. 217-37.
40. Spears, W.M., Spears, D.F., Hamann, J.C. and Heil, R. (2004), “Distributed, physics-based control of swarms of vehicles”, Autonomous Robots, Vol. 17 Nos 2-3, pp. 137-62.
41. TRP++ (2002), “Temporal resolution prover”, available at: www.csc.liv.ac.uk/∼konev/software/trp++.
42. Winfield, A. and Nembrini, J. (2006), “Safety in numbers: fault tolerance in robot swarms”, International Journal of Modelling Identification and Control, Vol. 1 No. 1, pp. 30-7.
43. Winfield, A., Sa, J., Fernández Gago, M.-C., Dixon, C. and Fisher, M. (2005), “On formal specification of emergent behaviours in swarm robotic systems”, International Journal of Advanced Robotic Systems, Vol. 2 No. 4, pp. 363-70.
44. Wolper, P. (1985), “The tableau method for temporal logic: an overview”, Logique et Analyse, Vol. 110-111, pp. 119-36.
45. Wolter, F. and Zakharyaschev, M. (2002), “Axiomatizing the monodic fragment of first-order temporal logic”, Annals of Pure and Applied Logic, Vol. 118 Nos 1-2, pp. 133-45.