Skip to main content

Qualitative Approximate Behavior Composition

  • Conference paper
Logics in Artificial Intelligence (JELIA 2012)

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

Included in the following conference series:

  • 838 Accesses

Abstract

The behavior composition problem involves automatically building a controller that is able to realize a desired, but unavailable, target system (e.g., a house surveillance) by suitably coordinating a set of available components (e.g., video cameras, blinds, lamps, a vacuum cleaner, phones, etc.) Previous work has almost exclusively aimed at bringing about the desired component in its totality, which is highly unsatisfactory for unsolvable problems. In this work, we develop an approach for approximate behavior composition without departing from the classical setting, thus making the problem applicable to a much wider range of cases. Based on the notion of simulation, we characterize what a maximal controller and the “closest” implementable target module (optimal approximation) are, and show how these can be computed using ATL model checking technology for a special case. We show the uniqueness of optimal approximations, and prove their soundness and completeness with respect to their imported controllers.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM (49), 672–713 (2002)

    Google Scholar 

  2. Balbiani, P., Cheikh, F., Feuillade, G.: Composition of interactive web services based on controller synthesis. In: Proc. of SERVICES, pp. 521–528 (2008)

    Google Scholar 

  3. Berardi, D., Cheikh, F., De Giacomo, G., Patrizi, F.: Automatic service composition via simulation. International Journal of Foundations of Computer Science 19(2), 429–452 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bloem, R., Jobstmann, B., Piterman, N., Pnueli, A., Saar, Y.: Synthesis of reactive(1) designs. Journal of Computer and System Sciences, 1–28 (2011)

    Google Scholar 

  5. De Giacomo, G., Felli, P.: Agent composition synthesis based on ATL. In: Proc. of AAMAS, pp. 499–506 (2010)

    Google Scholar 

  6. De Giacomo, G., Sardina, S.: Automatic synthesis of new behaviors from a library of available behaviors. In: Proc. of IJCAI, pp. 1866–1871 (2007)

    Google Scholar 

  7. French, S.: Decision Theory: An Introduction to the Mathematics of Rationality. Ellis Horwood (1986)

    Google Scholar 

  8. Ghallab, M., Nau, D.S., Traverso, P.: Automated Planning: Theory and Practice. Morgan Kaufmann Publishers Inc. (2004)

    Google Scholar 

  9. Girard, A., Pappas, G.: Approximation metrics for discrete and continuous systems. IEEE Transactions on Automatic Control 52(5), 782–798 (2007)

    Article  MathSciNet  Google Scholar 

  10. Hull, R.: Web services composition: A story of models, automata, and logics. In: Proc. of SCC, pp. 18–19 (2005)

    Google Scholar 

  11. Lomuscio, A., Qu, H., Raimondi, F.: MCMAS: A Model Checker for the Verification of Multi-Agent Systems. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 682–688. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Lustig, Y., Vardi, M.Y.: Synthesis from Component Libraries. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 395–409. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  13. Milner, R.: An algebraic definition of simulation between programs. In: Proc. of IJCAI, pp. 481–489 (1971)

    Google Scholar 

  14. Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. of POPL, pp. 179–190 (1989)

    Google Scholar 

  15. Saffiotti, A., Broxvall, M.: PEIS ecologies: Ambient intelligence meets autonomous robotics. In: Proc. of the International Conference on Smart Objects and Ambient Intelligence, pp. 275–280 (2005)

    Google Scholar 

  16. Sardina, S., De Giacomo, G.: Realizing multiple autonomous agents through scheduling of shared devices. In: Proc. of ICAPS, pp. 304–312 (2008)

    Google Scholar 

  17. Sardina, S., Patrizi, F., De Giacomo, G.: Behavior composition in the presence of failure. In: Proc. of KR, pp. 640–650 (2008)

    Google Scholar 

  18. Shoham, Y.: Agent-oriented programming. Artificial Intelligence Journal 60, 51–92 (1993)

    Article  MathSciNet  Google Scholar 

  19. Stroeder, T., Pagnucco, M.: Realising deterministic behaviour from multiple non-deterministic behaviours. In: Proc. of IJCAI, pp. 936–941 (2009)

    Google Scholar 

  20. Yadav, N., Sardina, S.: Decision theoretic behavior composition. In: Proc. of AAMAS, pp. 575–582 (2011)

    Google Scholar 

  21. Yadav, N., Sardina, S.: Qualitative approximate behavior composition (2012) Available from CoRR, http://arxiv.org/abs/1207.3863

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yadav, N., Sardina, S. (2012). Qualitative Approximate Behavior Composition. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds) Logics in Artificial Intelligence. JELIA 2012. Lecture Notes in Computer Science(), vol 7519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33353-8_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33353-8_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33352-1

  • Online ISBN: 978-3-642-33353-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics