| On correct and complete strong merging of partial behaviour models |
| Full text |
Pdf
(412 KB)
|
| Source
|
Foundations of Software Engineering
archive
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
table of contents
Atlanta, Georgia
SESSION: Requirements
table of contents
Pages: 297-307
Year of Publication: 2008
ISBN:978-1-59593-995-1
|
|
Authors
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 6, Downloads (12 Months): 62, Citation Count: 0
|
|
|
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
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
|
|
| |
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
|
|
| |
7
|
|
| |
8
|
J. Kramer, J. Magee, and M. Sloman. "CONIC: an Integrated Approach to Distributed Computer Control Systems". IEE Proceedings, 130(1):1--10, 1983.
|
| |
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
|
|
| |
11
|
K. G. Larsen and B. Thomsen. A modal process logic. In LICS, pages 203--210. IEEE Computer Society, 1988.
|
| |
12
|
|
| |
13
|
|
| |
14
|
|
 |
15
|
|
|