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.
- Tech. Report. http://www.doc.ic.ac.uk/srdipi/tech.Google Scholar
- R. Bellman. A Markovian decision process. Journal of Mathematics and Mechanics., 6:679--684, 1957.Google Scholar
- 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 ScholarDigital Library
- L. De Alfaro and T. Henzinger. Interface automata. ESEC/FSE-9, pages 109--120, 2001. Google ScholarDigital Library
- N. D'Ippolito, V. Braberman, N. Piterman, and S. Uchitel. Synthesis of Live Behaviour Models. In FSE. ACM, 2010. Google ScholarDigital Library
- N. D'Ippolito, D. Fischbein, M. Chechik, and S. Uchitel. MTSA: The modal transition system analyser. In ASE, pages 475--476. ACM, 2008. Google ScholarDigital Library
- E. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In FOCS. 1988. Google ScholarDigital Library
- N. Francez. Fairness. Springer-Verlag, 1986. Google ScholarDigital Library
- D. Giannakopoulou and J. Magee. Fluent model checking for event-based systems. ESEC/FSE-11, pages 257--266, 2003. Google ScholarDigital Library
- F. Giunchiglia and P. Traverso. Planning as model checking. ECP, pages 1--20, 2000. Google ScholarDigital Library
- 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 Scholar
- W. Heaven, D. Sykes, J. Magee, J. Kramer. A Case Study in Goal-Driven Architectural Adaptation. SESAS, 2009. Google ScholarDigital Library
- C. Hoare. Communicating sequential processes. Communications of the ACM, 21(8):677, 1978. Google ScholarDigital Library
- 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 ScholarDigital Library
- M. Jackson. The world and the machine. In ICSE, 1995. Google ScholarDigital Library
- A. V. Lamsweerde. Goal-oriented requirements engineering: A guided tour. RE, page 249, 2001. Google ScholarDigital Library
- E. Letier, J. Kramer, J. Magee, and S. Uchitel. Deriving event-based transition systems from goal-oriented requirements models. ASE, 2008. Google ScholarDigital Library
- C. Lewerentz and T. Lindner, editors. Formal Development of Reactive Systems - Case Study Production Cell, LNCS 891. Springer, 1995. Google ScholarDigital Library
- D. L. Parnas and J. Madey. Functional documents for computer systems. SCP, 25(1):41--61, 1995. Google ScholarDigital Library
- 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 Scholar
- N. Piterman and A. Pnueli. Faster solutions of Rabin and Streett games. In LICS, pages 275--284, 2006. Google ScholarDigital Library
- N. Piterman, A. Pnueli, and Y. Sa'ar. Synthesis of reactive (1) designs. VMCAI, pages 364--380, 2006. Google ScholarDigital Library
- A. Pnueli and R. Rosner. On the synthesis of a reactive module. In POPL. ACM, 1989. Google ScholarDigital Library
- P. Ramadge and W. Wonham. The control of discrete event systems. Proc. of the IEEE, 77(1):81--98, 1989.Google ScholarCross Ref
- S. Russell and P. Norvig. Artificial intelligence: a modern approach. New Jersey, 1995. Google ScholarDigital Library
- D. Sykes, W. Heaven, J. Magee, and J. Kramer. Plan-directed architectural change for autonomous systems. In SAVCBS, pages 15--21. ACM, 2007. Google ScholarDigital Library
- 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 ScholarDigital Library
Index Terms
Synthesis of live behaviour models for fallible domains
Recommendations
Synthesis of live behaviour models
FSE '10: Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineeringWe present a novel technique for synthesising behaviour models that works for an expressive subset of liveness properties and conforms to the foundational requirements engineering World/Machine model, dealing explicitly with assumptions on environment ...
Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems
Coloured Petri Nets (CPNs) is a language for the modelling and validation of systems in which concurrency, communication, and synchronisation play a major role. Coloured Petri Nets is a discrete-event modelling language combining Petri nets with the ...
Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems
AbstractColoured Petri Nets (CPNs) is a language for the modelling and validation of systems in which concurrency, communication, and synchronisation play a major role. Coloured Petri Nets is a discrete-event modelling language combining Petri nets with ...
Comments