A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
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)
Specification-Oriented Semantics for Communicating Processes
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Logic and refinement for charts
ACSC '06 Proceedings of the 29th Australasian Computer Science Conference - Volume 48
Semantic reasoning about feature composition via multiple aspect-weavings
Proceedings of the 5th international conference on Generative programming and component engineering
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Behavior consistent inheritance in UML
ER'00 Proceedings of the 19th international conference on Conceptual modeling
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
Towards a formal foundation of behavioral types for UML state-machines
ACM SIGSOFT Software Engineering Notes
Behavioral Refinement and Compatibility of Statechart Extensions
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We consider semantic refinement of behavioral models represented as state transition diagrams (SD). The idea is to start with a base model and then to add small features, represented as extension of SDs, adding previously unspecified behavior. These features may add new states and transitions or refine existing transitions. We develop an expressive formal framework for behavioral refinements of non-deterministic SDs based on input/output event traces. We generalize existing kinds of refinements to a new concept based on eliminations on the trace level. These eliminations remove the added behavior and we establish behavior preserving refinement relations based on this. We present several cases for refinement which preserve different properties. Furthermore, we show how to combine refinements and discuss what properties are preserved.