Statecharts: A visual formalism for complex systems
Science of Computer Programming
Formal Approach to Scenario Analysis
IEEE Software
Generating statechart designs from scenarios
Proceedings of the 22nd international conference on Software engineering
Compiler Construction: Principles and Practice
Compiler Construction: Principles and Practice
Automated Support for Modeling OO Software
IEEE Software
An Integrated Formal Model of Scenarios Based on Statecharts
Proceedings of the 5th European Software Engineering Conference
Automating the Synthesis of UML StateChart Diagrams from Multiple Collaboration Diagrams
«UML» '98 Selected papers from the First International Workshop on The Unified Modeling Language «UML»'98: Beyond the Notation
Developing with UML - Some Pitfalls and Workarounds
«UML» '98 Selected papers from the First International Workshop on The Unified Modeling Language «UML»'98: Beyond the Notation
From Scenarios to Timed Automata: Building Specifications from Users Requirements
APSEC '95 Proceedings of the Second Asia Pacific Software Engineering Conference
Checking compositions of UML sequence diagrams for timing inconsistency
APSEC '00 Proceedings of the Seventh Asia-Pacific Software Engineering Conference
Synthesizing Software Architecture Descriptions from Message Sequence Chart Specifications
ASE '98 Proceedings of the 13th IEEE international conference on Automated software engineering
Branching time semantics for UML 2.0 sequence diagrams
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
| Hi-index | 0.00 |
Sequence Diagrams (SDs) have proven useful for describing transaction-oriented systems, and can form a basis for creating statecharts. However, distributed embedded systems require special support for branching, state information, and composing SDs. Actors must traverse many SDs when using a complex embedded system. Current techniques are insufficiently rich to represent the behavior of real systems, such as elevators, without augmentation, and cannot identify the correct SD to execute next from any given state of the system. We propose the application of formal language theory to ensure that SDs (which can be thought of as specifying a grammar) have sufficient information to create statecharts (which implement the automata that recognize that grammar). A promising approach for SD to statechart synthesis then involves 'compiling' SDs represented in an LL(1) grammar into statecharts, and permits us to bring the wealth of formal language and compiler theory to bear on this problem area.