A classical mind
A Constraint Oriented Proof Methodology Based on Modal Transition Systems
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
A Modal Characterisation of Observable Machine-Behaviour
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Merging partial behavioural models
Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
Refinement is complete for implementations
Formal Aspects of Computing
A foundation for behavioural conformance in software product line architectures
Proceedings of the ISSTA 2006 workshop on Role of software architecture for testing and analysis
Behaviour Model Synthesis from Properties and Scenarios
ICSE '07 Proceedings of the 29th international conference on Software Engineering
A behavioural model for product families
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Modal I/O automata for interface and product line theories
ESOP'07 Proceedings of the 16th European conference on Programming
Properties of behavioural model merging
FM'06 Proceedings of the 14th international conference on Formal Methods
A Sound Observational Semantics for Modal Transition Systems
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineering
Exploring inconsistencies between modal transition systems
Software and Systems Modeling (SoSyM)
Weak Alphabet Merging of Partial Behavior Models
ACM Transactions on Software Engineering and Methodology (TOSEM)
Required behavior of sequence diagrams: Semantics and conformance
ACM Transactions on Software Engineering and Methodology (TOSEM)
Merging partial behaviour models with different vocabularies
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Supporting incremental behaviour model elaboration
Computer Science - Research and Development
Supporting incremental behaviour model elaboration
Computer Science - Research and Development
Abstract Probabilistic Automata
Information and Computation
| Hi-index | 0.00 |
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.