Statecharts: A visual formalism for complex systems
Science of Computer Programming
ACM Transactions on Software Engineering and Methodology (TOSEM)
Formal verification of parallel programs
Communications of the ACM
The Use of Static Constructs in A Modal Process Logic
Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89
Merging partial behavioural models
Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
Existential live sequence charts revisited
Proceedings of the 30th international conference on Software engineering
On correct and complete strong merging of partial behaviour models
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
Synthesis of Partial Behavior Models from Properties and Scenarios
IEEE Transactions on Software Engineering
A Sound Observational Semantics for Modal Transition Systems
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
MTSA: The Modal Transition System Analyser
ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
Modal transition systems: composition and LTL model checking
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Weak Alphabet Merging of Partial Behavior Models
ACM Transactions on Software Engineering and Methodology (TOSEM)
| Hi-index | 0.00 |
Modal transition systems (MTSs) and their variants such as Disjunctive MTSs (DMTSs) have been extensively studied as a formalism for partial behaviour model specification. Their semantics is in terms of implementations, which are fully specified behaviour models in the form of Labelled Transition Systems. A natural operation for these models is that of merge, which should yield a partial model which characterizes all common implementations. Merging has been studied for models with the same vocabularies; however, to enable composition of specifications from different viewpoints, merging of models with different vocabularies must be supported as well. In this paper, we first prove that DMTSs are not closed under merge for models with different vocabularies. We then define an extension to DMTS called rDMTS, for which we describe a first exact algorithm for merging partial models, provided they satisfy an easily checkable compatibility condition.