Statecharts: A visual formalism for complex systems
Science of Computer Programming
Real-time object-oriented modeling
Real-time object-oriented modeling
The Linear Time-Branching Time Spectrum (Extended Abstract)
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Towards a Formal Operational Semantics of UML Statechart Diagrams
Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS)
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Formal semantics for interacting UML subsystems
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
Modeling the meaning of transitions from and to concurrent states in UML state machines
Proceedings of the 2003 ACM symposium on Applied computing
On Semantics and Refinement of UML Statecharts: A Coalgebraic View
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Logic and refinement for charts
ACSC '06 Proceedings of the 29th Australasian Computer Science Conference - Volume 48
UML 2.0 state machines: complete formal semantics via core state machines
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
29 new unclarities in the semantics of UML 2.0 state machines
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Argos: an automaton-based synchronous language
Computer Languages
ACM SIGSOFT Software Engineering Notes
| Hi-index | 0.00 |
While the semantics of (labeled) transition systems and the relations between these are well understood, the same still needs to be achieved for UML 2.x state machines, because the UML standard is ambiguous and admits many semantics, which are often defined in terms of labeled transition systems. A formal semantics for UML state machines with interlevel transitions and notions of refinement are described to enable the study of transformations, i.e., functions from state machines to state machines, and to establish the conditions under which these transformations are refinement steps. Many of these transformations are described and shown to be refinement steps. A language extension is finally proposed that help modelers to ensure that all transformations are indeed refinements.