Incremental design of statechart specifications
Science of Computer Programming - Specical issue on fundamental approaches to software engineering
Behavior-consistent specialization of object life cycles
ACM Transactions on Software Engineering and Methodology (TOSEM)
Parameterized Interfaces for Open System Verification of Product Lines
Proceedings of the 19th IEEE international conference on Automated software engineering
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
Logic and refinement for charts
ACSC '06 Proceedings of the 29th Australasian Computer Science Conference - Volume 48
Reconciling statechart semantics
Science of Computer Programming
Timed I/O automata: a complete specification theory for real-time systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Multifunctional software systems: Structured modeling and specification of functional requirements
Science of Computer Programming
Compositional model checking of software product lines using variation point obligations
Automated Software Engineering
HiLA: high-level aspects for UML state machines
MODELS'09 Proceedings of the 2009 international conference on Models in Software Engineering
On weak modal compatibility, refinement, and the MIO workbench
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Behavioral refinement of non-deterministic state transition diagrams based on behavior elimination
Proceedings of the 17th International Software Product Line Conference co-located workshops
| Hi-index | 0.00 |
We compare the notions of refinement and compatibility for system models and their variants described as statecharts. Compatibility, in the sense of substitutability, means that a system can be used in any place where the original one was used. We show that existing definitions of refinement and compatibility are orthogonal, if they include an interface extension. Then, we focus on extended compatibility, which means that the system returns to a compatible behavior after some time even if the newly added features are used. Our new result shows under what conditions the usage of a newly added feature preserves behavior. More specifically, we perform a novel kind of elimination of the newly added behavior on a trace level. In this way, we can achieve extended compatibility even if the newly added features use existing input and output events, which is not possible with existing abstractions and refinement concepts.