skip to main content
10.1145/1985793.1985823acmconferencesArticle/Chapter ViewAbstractPublication PagesicseConference Proceedingsconference-collections
research-article

Synthesis of live behaviour models for fallible domains

Authors Info & Claims
Published:21 May 2011Publication History

ABSTRACT

We revisit synthesis of live controllers for event-based operational models. We remove one aspect of an idealised problem domain by allowing to integrate failures of controller actions in the environment model. Classical treatment of failures through strong fairness leads to a very high computational complexity and may be insufficient for many interesting cases. We identify a realistic stronger fairness condition on the behaviour of failures. We show how to construct controllers satisfying liveness specifications under these fairness conditions. The resulting controllers exhibit the only possible behaviour in face of the given topology of failures: they keep retrying and never give up. We then identify some well-structure conditions on the environment. These conditions ensure that the resulting controller will be eager to satisfy its goals. Furthermore, for environments that satisfy these conditions and have an underlying probabilistic behaviour, the measure of traces that satisfy our fairness condition is 1, giving a characterisation of the kind of domains in which the approach is applicable.

References

  1. Tech. Report. http://www.doc.ic.ac.uk/srdipi/tech.Google ScholarGoogle Scholar
  2. R. Bellman. A Markovian decision process. Journal of Mathematics and Mechanics., 6:679--684, 1957.Google ScholarGoogle Scholar
  3. Y. Bontemps, P. Schobbens, and C. Löding. Synthesis of open reactive systems from scenario-based specifications. Fundamenta Informaticae, 62(2):139--169, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. L. De Alfaro and T. Henzinger. Interface automata. ESEC/FSE-9, pages 109--120, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. N. D'Ippolito, V. Braberman, N. Piterman, and S. Uchitel. Synthesis of Live Behaviour Models. In FSE. ACM, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. N. D'Ippolito, D. Fischbein, M. Chechik, and S. Uchitel. MTSA: The modal transition system analyser. In ASE, pages 475--476. ACM, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. E. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In FOCS. 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. N. Francez. Fairness. Springer-Verlag, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. D. Giannakopoulou and J. Magee. Fluent model checking for event-based systems. ESEC/FSE-11, pages 257--266, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. F. Giunchiglia and P. Traverso. Planning as model checking. ECP, pages 1--20, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. H. Kress-Gazit, D. Conner, H. Choset, A. Rizzi, and G. Pappas. Courteous Cars: Decentralized Multiagent Traffic Coordination. IEEE Robotics & Automation, 15(1):30--38, 2008.Google ScholarGoogle Scholar
  12. W. Heaven, D. Sykes, J. Magee, J. Kramer. A Case Study in Goal-Driven Architectural Adaptation. SESAS, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. C. Hoare. Communicating sequential processes. Communications of the ACM, 21(8):677, 1978. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. P. Inverardi and M. Tivoli. A reuse-based approach to the correct and automatic composition of web-services. In FSE ESSPE, page 33. ACM, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. M. Jackson. The world and the machine. In ICSE, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. A. V. Lamsweerde. Goal-oriented requirements engineering: A guided tour. RE, page 249, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. E. Letier, J. Kramer, J. Magee, and S. Uchitel. Deriving event-based transition systems from goal-oriented requirements models. ASE, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. C. Lewerentz and T. Lindner, editors. Formal Development of Reactive Systems - Case Study Production Cell, LNCS 891. Springer, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. D. L. Parnas and J. Madey. Functional documents for computer systems. SCP, 25(1):41--61, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. M. Pistore, F. Barbon, P. Bertoli, D. Shaparau, and P. Traverso. Planning and monitoring web service composition. Artificial Intelligence: Methodology, Systems, and Applications, pages 106--115, 2004.Google ScholarGoogle Scholar
  21. N. Piterman and A. Pnueli. Faster solutions of Rabin and Streett games. In LICS, pages 275--284, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. N. Piterman, A. Pnueli, and Y. Sa'ar. Synthesis of reactive (1) designs. VMCAI, pages 364--380, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In POPL. ACM, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. P. Ramadge and W. Wonham. The control of discrete event systems. Proc. of the IEEE, 77(1):81--98, 1989.Google ScholarGoogle ScholarCross RefCross Ref
  25. S. Russell and P. Norvig. Artificial intelligence: a modern approach. New Jersey, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. D. Sykes, W. Heaven, J. Magee, and J. Kramer. Plan-directed architectural change for autonomous systems. In SAVCBS, pages 15--21. ACM, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. S. Uchitel, G. Brunet, and M. Chechik. Behaviour model synthesis from properties and scenarios. In IEEE Trans. Software Eng., pages 384--406. IEEE, 2009.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Synthesis of live behaviour models for fallible domains

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      ICSE '11: Proceedings of the 33rd International Conference on Software Engineering
      May 2011
      1258 pages
      ISBN:9781450304450
      DOI:10.1145/1985793

      Copyright © 2011 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 21 May 2011

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate276of1,856submissions,15%

      Upcoming Conference

      ICSE 2024

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader