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

Detalles Bibliográficos
Publicado:	2008
Materias:	Elaboration Merge Modal Transition Systems Partial Behaviour Models Behaviour models Current limitation Description languages Goal models Operational description Over-constrained Partial information Algorithms Computer software Mergers and acquisitions Merging Mathematical models
Acceso en línea:	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_97815959_v_n_p297_Fischbein http://hdl.handle.net/20.500.12110/paper_97815959_v_n_p297_Fischbein
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	paper:paper_97815959_v_n_p297_Fischbein
record_format	dspace
spelling	paper:paper_97815959_v_n_p297_Fischbein2023-06-08T16:38:07Z On correct and complete strong merging of partial behaviour models 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 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. 2008 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_97815959_v_n_p297_Fischbein http://hdl.handle.net/20.500.12110/paper_97815959_v_n_p297_Fischbein
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-134
collection	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic	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
spellingShingle	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 On correct and complete strong merging of partial behaviour models
topic_facet	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
description	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.
title	On correct and complete strong merging of partial behaviour models
title_short	On correct and complete strong merging of partial behaviour models
title_full	On correct and complete strong merging of partial behaviour models
title_fullStr	On correct and complete strong merging of partial behaviour models
title_full_unstemmed	On correct and complete strong merging of partial behaviour models
title_sort	on correct and complete strong merging of partial behaviour models
publishDate	2008
url	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_97815959_v_n_p297_Fischbein http://hdl.handle.net/20.500.12110/paper_97815959_v_n_p297_Fischbein
_version_	1768544469104197632

On correct and complete strong merging of partial behaviour models

Ejemplares similares