On correct and complete strong merging of partial behaviour models

Modal Transition Systems (MTS) have been shown to be useful to reason about system behaviour in the context of partial information and to support incremental elaboration of behaviour models. A particularly useful notion in the context of software and requirements engineering is that of merge. MTS me...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Fischbein, D.
Otros Autores: Uchitel, Sebastián
Formato: Acta de conferencia Capítulo de libro
Lenguaje:Inglés
Publicado: 2008
Acceso en línea:Registro en Scopus
DOI
Handle
Registro en la Biblioteca Digital
Aporte de:Registro referencial: Solicitar el recurso aquí
LEADER 06431caa a22006977a 4500
001 PAPER-22258
003 AR-BaUEN
005 20251211114329.0
008 190411s2008 xx ||||fo|||| 10| 0 eng|d
024 7 |2 scopus  |a 2-s2.0-77950511686 
040 |a Scopus  |b spa  |c AR-BaUEN  |d AR-BaUEN 
100 1 |a Fischbein, D. 
245 1 3 |a On correct and complete strong merging of partial behaviour models 
260 |c 2008 
270 1 0 |m Fischbein, D.; Department of Computing, Imperial College London, 180 Queen's Gate, London, SW7 2RH, United Kingdom; email: d.fischbein@doc.ic.ac.uk 
504 |a Brunet, G., (2006) A Characterization of Merging Partial Behavioural Models, , Master's thesis, Univ. of Toronto, January 
504 |a Brunet, G., Chechik, M., Uchitel, S., Properties of behavioural model merging (2006) Lecture Notes in Computer Science, 4085, pp. 98-114. , J. Misra, T. Nipkow, and E. Sekerinski, editors, FM, Springer 
504 |a Fantechi, A., Gnesi, S., A behavioural model for product families (2007) ESEC-FSE Companion ' 07, pp. 521-524. , New York, NY, USA, ACM 
504 |a Fischbein, D., (2006) Branching Semantics for Modal Transition Systems, , Master's thesis University of Buenos Aires Department of Computing April 
504 |a Fischbein, D., Uchitel, S., http://www.doc.ic.ac.uk/~fdario/FSE08/; Fischbein, D., Uchitel, S., Braberman, V., A foundation for behavioural conformance in software product line architectures (2006) ROSATEA '06: Proceedings of the ISSTA 2006 Workshop on Role of Software Architecture for Testing and Analysis, pp. 39-48. , New York, NY, USA, ACM Press 
504 |a Huth, M., Refinement is complete for implementations (2005) Formal Aspects of Computing, 17 (2), pp. 113-137. , DOI 10.1007/s00165-005-0063-z 
504 |a Kramer Jeff, Magee Jeff, Sloman Morris, Lister Andrew, Conic: An integrated approach to distributed computer control systems (1983) IEE Proceedings E: Computers and Digital Techniques, 130 (1), pp. 1-10 
504 |a Larsen, K.G., Nyman, U., Wasowski, A., Modal i/o automata for interface and product line theories (2007) Lecture Notes in Computer Science, 4421, pp. 64-79. , R. D. Nicola, editor, ESOP, Springer 
504 |a Larsen, K.G., Steffen, B., Weise, C., A constraint oriented proof methodology based on modal transition systems (1995) Lecture Notes in Computer Science, 1019, pp. 17-40. , E. Brinksma, R. Cleaveland, K. G. Larsen, T. Margaria, and B. Steffen, editors, TACAS Springer 
504 |a Larsen, K.G., Thomsen, B., A modal process logic (1988) LICS, pp. 203-210. , IEEE Computer Society 
504 |a Milner, R., A modal characterisation of observable machine-behaviour (1981) CAAP '81: Proceedings of the 6th Colloquium on Trees in Algebra and Programming, pp. 25-34. , London, UK, Springer-Verlag 
504 |a Roscoe, A.W., Model-checking csp (1994) A Classical Mind: Essays in Honour of C. A. R. Hoare, pp. 353-378. , Hertfordshire, UK, UK, Prentice Hall International (UK) Ltd 
504 |a Uchitel, S., Brunet, G., Chechik, M., Behaviour model synthesis from properties and scenarios (2007) ICSE, pp. 34-43. , IEEE Computer Society 
504 |a Uchitel, S., Chechik, M., Merging partial behavioural models (2004) SIGSOFT FSE, pp. 43-52. , R. N. Taylor and M. B. Dwyer, editors, ACMA4 - ACM SIGSOFT 
506 |2 openaire  |e Política editorial 
520 3 |a Modal Transition Systems (MTS) have been shown to be useful to reason about system behaviour in the context of partial information and to support incremental elaboration of behaviour models. A particularly useful notion in the context of software and requirements engineering is that of merge. MTS merging can be used as the conjunction of multiple partial operational descriptions which may have been provided as MTS or even synthesised from other description languages such as goal models and scenarios. One of the current limitations of MTS merging is that a complete and correct algorithm for merging has not been developed. Hence, an engineer attempting to merge partial descriptions may be prevented to do so by overconstrained algorithms or algorithms that introduce behaviour that does not follow from the partial descriptions being merged. This paper resolves these problems for strong semantics by providing a complete characterization of MTS consistency and a correct and complete algorithm for MTS merging. © 2008 ACM.  |l eng 
536 |a Detalles de la financiación: Engineering and Physical Sciences Research Council, EPSRC, EP/C541138/1 
593 |a Department of Computing, Imperial College London, 180 Queen's Gate, London, SW7 2RH, United Kingdom 
593 |a University of Buenos Aires, Imperial College London C1428EGA, Argentina 
690 1 0 |a ELABORATION 
690 1 0 |a MERGE 
690 1 0 |a MODAL TRANSITION SYSTEMS 
690 1 0 |a PARTIAL BEHAVIOUR MODELS 
690 1 0 |a BEHAVIOUR MODELS 
690 1 0 |a CURRENT LIMITATION 
690 1 0 |a DESCRIPTION LANGUAGES 
690 1 0 |a GOAL MODELS 
690 1 0 |a MODAL TRANSITION SYSTEMS 
690 1 0 |a OPERATIONAL DESCRIPTION 
690 1 0 |a OVER-CONSTRAINED 
690 1 0 |a PARTIAL INFORMATION 
690 1 0 |a ALGORITHMS 
690 1 0 |a COMPUTER SOFTWARE 
690 1 0 |a MERGERS AND ACQUISITIONS 
690 1 0 |a MERGING 
690 1 0 |a MATHEMATICAL MODELS 
700 1 |a Uchitel, Sebastián 
711 2 |c Atlanta, GA  |d 9 November 2008 through 14 November 2008  |g Código de la conferencia: 79694 
773 0 |d 2008  |h pp. 297-307  |p Proc ACM SIGSOFT Symp Found Software Eng  |n Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering  |z 9781595939951  |t 16th ACM SIGSOFT International Symposium on the Foundations of Software Engineering, SIGSOFT 2008/FSE-16 
856 4 1 |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-77950511686&doi=10.1145%2f1453101.1453144&partnerID=40&md5=18c33e6d9d5197c54329b6f0295fe764  |y Registro en Scopus 
856 4 0 |u https://doi.org/10.1145/1453101.1453144  |y DOI 
856 4 0 |u https://hdl.handle.net/20.500.12110/paper_97815959_v_n_p297_Fischbein  |y Handle 
856 4 0 |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_97815959_v_n_p297_Fischbein  |y Registro en la Biblioteca Digital 
961 |a paper_97815959_v_n_p297_Fischbein  |b paper  |c PE 
962 |a info:eu-repo/semantics/conferenceObject  |a info:ar-repo/semantics/documento de conferencia  |b info:eu-repo/semantics/publishedVersion 
999 |c 83211