On correct and complete strong merging of partial behaviour models

Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering

Volumn , Issue , 2008, Pages 297-307

  Fischbein, Dario ^a   Uchitel, Sebastian ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSIDAD DE BUENOS AIRES   (Argentina)

Author keywords

Elaboration; Merge; Modal Transition Systems; Partial Behaviour Models

Indexed keywords

BEHAVIOUR MODELS; CURRENT LIMITATION; DESCRIPTION LANGUAGES; GOAL MODELS; MODAL TRANSITION SYSTEMS; OPERATIONAL DESCRIPTION; OVER-CONSTRAINED; PARTIAL INFORMATION;

ALGORITHMS; COMPUTER SOFTWARE; MERGERS AND ACQUISITIONS; MERGING;

MATHEMATICAL MODELS;

EID: 77950511686     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1453101.1453144     Document Type: Conference Paper

References (15)

1. G. Brunet. "A Characterization of Merging Partial Behavioural Models". Master's thesis, Univ. of Toronto, January 2006.
2. G. Brunet, M. Chechik, and S. Uchitel. Properties of behavioural model merging. In J. Misra, T. Nipkow, and E. Sekerinski, editors, FM, volume 4085 of Lecture Notes in Computer Science, pages 98-114. Springer, 2006.
3. A. Fantechi and S. Gnesi. A behavioural model for product families. In ESEC-FSE companion '07, pages 521-524, New York, NY, USA, 2007. ACM.
4. D. Fischbein. Branching semantics for modal transition systems. Master's thesis, University of Buenos Aires, Department of Computing, April 2006.
5. D. Fischbein and S. Uchitel. http://www.doc.ic.ac.uk/~fdario/FSE08/.
6. D. Fischbein, S. Uchitel, and V. Braberman. A foundation for behavioural conformance in software product line architectures. In ROSATEA '06: Proceedings of the ISSTA 2006 workshop on Role of software architecture for testing and analysis, pages 39-48, New York, NY, USA, 2006. ACM Press.
7. M. Huth. Refinement is complete for implementations. Formal Asp. Comput., 17(2):113-137, 2005. (Pubitemid 41165025)
8. J. Kramer, J. Magee, and M. Sloman. "CONIC: an Integrated Approach to Distributed Computer Control Systems". IEE Proceedings, 130(1):1-10, 1983. (Pubitemid 13523514)
9. K. G. Larsen, U. Nyman, and A. Wasowski. Modal i/o automata for interface and product line theories. In R. D. Nicola, editor, ESOP, volume 4421 of Lecture Notes in Computer Science, pages 64-79. Springer, 2007.
10. K. G. Larsen, B. Steffen, and C. Weise. A constraint oriented proof methodology based on modal transition systems. In E. Brinksma, R. Cleaveland, K. G. Larsen, T. Margaria, and B. Steffen, editors, TACAS, volume 1019 of Lecture Notes in Computer Science, pages 17-40. Springer, 1995.
11. K. G. Larsen and B. Thomsen. A modal process logic. In LICS, pages 203-210. IEEE Computer Society, 1988.
12. R. Milner. A modal characterisation of observable machine-behaviour. In CAAP '81: Proceedings of the 6th Colloquium on Trees in Algebra and Programming, pages 25-34, London, UK, 1981. Springer-Verlag.
13. A. W. Roscoe. Model-checking csp. In A classical mind: essays in honour of C. A. R. Hoare, pages 353-378, Hertfordshire, UK, UK, 1994. Prentice Hall International (UK) Ltd.
14. S. Uchitel, G. Brunet, and M. Chechik. Behaviour model synthesis from properties and scenarios. In ICSE, pages 34-43. IEEE Computer Society, 2007.
15. S. Uchitel and M. Chechik. Merging partial behavioural models. In R. N. Taylor and M. B. Dwyer, editors, SIGSOFT FSE, pages 43-52. ACM, 2004.