Skip to main content

Testing Collaborative Agents Defined as Stream X-Machines with Distributed Grammars

  • Conference paper
  • First Online:
Advances in Artificial Life (ECAL 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2159))

Included in the following conference series:

Abstract

This paper presents a method for testing software collaborative agents. The method is based on the stream X-machine model using as basic processing relations sets of production rules and is built around an existing stream X-machine testing strategy already. The paper investigates different variants of the ‘design for test’ conditions required by this strategy and their applicability to the case of collaborative agents.

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

Access this chapter

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 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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aho, J. Ullman, The Theory of Parsing, Translation and Compiling, Vol. I: Parsing, Prentice-Hall, Englewood Cliffs, N.J, 1972.

    Google Scholar 

  2. T. Balanescu, Generalized stream X-machines with output delimited type, Formal Aspects of Computer Science, accepted, 2001.

    Google Scholar 

  3. T. Balanescu, T. Cowling, H. Georgescu, M. Gheorghe, M. Holcombe, C. Vertan, Communicating Stream X-Machines are more than X-Machines, J. of Universal Computer Sci., 5,9(1999), 492–507.

    MathSciNet  Google Scholar 

  4. T. Balanescu, H. Georgescu, M. Gheorghe, Stream X-machines with underlying Distributed Grammars, submitted 2001.

    Google Scholar 

  5. T. Balanescu, M. Gheorghe, M. Holcombe, A Subclass of Stream X-machines with Underlying Distributed Grammars, in Proceedings of the International Workshop Grammar Systems 2000, R. Freund and A. Kelemenova (eds), Bad Ischl, Austria, 2000, 93–111.

    Google Scholar 

  6. G. Bernot, M. Gaudel, B. Marre, Software testing based on formal specifications: a theory and a tool, Software Engineering Journal, 6(1991), 387–405.

    Article  Google Scholar 

  7. T.S. Chow, Testing software design modelled by finite-state machines, IEEE Transactions on Software Engineering, 4,3(1978), 178–187.

    Article  Google Scholar 

  8. E. Csuhaj-Varju, J. Dassow, J. Kelemen, Gh. Paun, Grammar Systems. A Grammatical Approach to Distribution and Cooperation, Gordon and Breach, London, 1994.

    MATH  Google Scholar 

  9. S. Eilenberg, Automata, languages, and machines, Vol. A, Academic Press, 1974.

    Google Scholar 

  10. M. Gheorghe, Generalized Stream X-machines and Cooperating Distributed Grammar Systems, Formal Aspects of Computer Science, accepted, 2001.

    Google Scholar 

  11. A. Gill, Introduction to the Theory of Finite-State Machines, McGraw-Hill, 1962.

    Google Scholar 

  12. M. Holcombe, X-machines as a basis for dynamic system specification, Software Engineering Journal 3(1988), 69–76.

    Article  Google Scholar 

  13. M. Holcombe, Computational models of cells and tissues-machines, agents and fungal infection, presented at UCL, London 15–16 Feb, 2001, submitted to Briefings in Bioinformatics.

    Google Scholar 

  14. M. Holcombe, F. Ipate, Correct Systems: Building a Business Process Solution, Springer Verlag, 1998.

    Google Scholar 

  15. F. Ipate, M. Holcombe, An Integration Testing Method That is Proved to Find all Faults, Intern. J. Computer Math, Vol 69 (1997), 159–178.

    Article  MathSciNet  Google Scholar 

  16. F. Ipate, M. Holcombe, Generating test sets from non-deterministic stream X-machines, Formal Aspects of Computer Science, accepted, 2001.

    Google Scholar 

  17. P. Kefalas, Modelling an Agent Reactive Architecture with X-Machines, Technical Report, CITY Liberal Studies, 2000.

    Google Scholar 

  18. Formal Models of Agents, (J-J. Ch Meyer, P-Y. Schobbens eds), Springer Verlag, LNAI 1760, 1999.

    Google Scholar 

  19. Gh. Paun, Computing with membranes, Journal of Computer and System Sciences, 61,1 (2000), 108–143.

    Article  MATH  MathSciNet  Google Scholar 

  20. Grammatical models of multi-agent systems, (Gh. Paun, A. Salomaa eds), Topics in Computer Mathematics 8, Gordon and Breach Science, Amsterdam, 1999.

    MATH  Google Scholar 

  21. A. S. Rao and M. P. Georgeff, BDI Agents: From Theory to Practice, in Proceedings of the 1st International Conference on Multi-Agent Systems, San Francisco, USA, 1995, 312–319.

    Google Scholar 

  22. M. Wooldridge, N.R. Jennings, Intelligent Agents-Theory and Practice, Knowledge Engineering Review, 10,2(1995), 115–152.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

B←↭escu, T., Gheorghe, M., Holcombe, M., Ipate, F. (2001). Testing Collaborative Agents Defined as Stream X-Machines with Distributed Grammars. In: Kelemen, J., Sosík, P. (eds) Advances in Artificial Life. ECAL 2001. Lecture Notes in Computer Science(), vol 2159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44811-X_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-44811-X_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42567-0

  • Online ISBN: 978-3-540-44811-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics