Statecharts: A visual formalism for complex systems
Science of Computer Programming
The Z notation: a reference manual
The Z notation: a reference manual
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
Refinement in Z and object-Z: foundations and advanced applications
Refinement in Z and object-Z: foundations and advanced applications
A Discipline of Programming
Formal Verification of Statecharts with Instantaneous Chain Reaction
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Compositional Specification of Embedded Systems with Statecharts
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Refinement patterns for hierarchical UML state machines
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Behavioral Refinement and Compatibility of Statechart Extensions
Electronic Notes in Theoretical Computer Science (ENTCS)
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 introduce a logic for reasoning about and constructing refinements for µ-Charts, a rational simplification and reconstruction of Statecharts. The method of derivation of the logic is that a semantics for the language is constructed in Z and the existing logic and refinement calculus of Z is then used to induce the logic and refinement calculus of µ-Charts, proceeding by a series of definitions and conservative extensions and hence generating a sound logic for µ-Charts, given that the soundness of the Z logic has already been established.