Abstract:
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.
Registro:
| Documento: |
Conferencia
|
| Título: | On correct and complete strong merging of partial behaviour models |
| Autor: | Fischbein, D.; Uchitel, S. |
| Ciudad: | Atlanta, GA |
| Filiación: | Department of Computing, Imperial College London, 180 Queen's Gate, London, SW7 2RH, United Kingdom
University of Buenos Aires, Imperial College London C1428EGA, Argentina
|
| Palabras clave: | Elaboration; Merge; Modal Transition Systems; Partial Behaviour Models; 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 |
| Año: | 2008
|
| Página de inicio: | 297
|
| Página de fin: | 307
|
| DOI: |
http://dx.doi.org/10.1145/1453101.1453144 |
| Título revista: | 16th ACM SIGSOFT International Symposium on the Foundations of Software Engineering, SIGSOFT 2008/FSE-16
|
| Título revista abreviado: | Proc ACM SIGSOFT Symp Found Software Eng
|
| Registro: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_97815959_v_n_p297_Fischbein |
Referencias:
- Brunet, G., (2006) A Characterization of Merging Partial Behavioural Models, , Master's thesis, Univ. of Toronto, January
- 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
- Fantechi, A., Gnesi, S., A behavioural model for product families (2007) ESEC-FSE Companion ' 07, pp. 521-524. , New York, NY, USA, ACM
- Fischbein, D., (2006) Branching Semantics for Modal Transition Systems, , Master's thesis University of Buenos Aires Department of Computing April
- 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
- Huth, M., Refinement is complete for implementations (2005) Formal Aspects of Computing, 17 (2), pp. 113-137. , DOI 10.1007/s00165-005-0063-z
- 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
- 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
- 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
- Larsen, K.G., Thomsen, B., A modal process logic (1988) LICS, pp. 203-210. , IEEE Computer Society
- 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
- 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
- Uchitel, S., Brunet, G., Chechik, M., Behaviour model synthesis from properties and scenarios (2007) ICSE, pp. 34-43. , IEEE Computer Society
- 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
Citas:
---------- APA ----------
Fischbein, D. & Uchitel, S.
(2008)
. On correct and complete strong merging of partial behaviour models. 16th ACM SIGSOFT International Symposium on the Foundations of Software Engineering, SIGSOFT 2008/FSE-16, 297-307.
http://dx.doi.org/10.1145/1453101.1453144---------- CHICAGO ----------
Fischbein, D., Uchitel, S.
"On correct and complete strong merging of partial behaviour models"
. 16th ACM SIGSOFT International Symposium on the Foundations of Software Engineering, SIGSOFT 2008/FSE-16
(2008) : 297-307.
http://dx.doi.org/10.1145/1453101.1453144---------- MLA ----------
Fischbein, D., Uchitel, S.
"On correct and complete strong merging of partial behaviour models"
. 16th ACM SIGSOFT International Symposium on the Foundations of Software Engineering, SIGSOFT 2008/FSE-16, 2008, pp. 297-307.
http://dx.doi.org/10.1145/1453101.1453144---------- VANCOUVER ----------
Fischbein, D., Uchitel, S. On correct and complete strong merging of partial behaviour models. Proc ACM SIGSOFT Symp Found Software Eng. 2008:297-307.
http://dx.doi.org/10.1145/1453101.1453144