Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Location Consistency-A New Memory Model and Cache Consistency Protocol
IEEE Transactions on Computers
Unified Modeling Language User Guide, The (2nd Edition) (Addison-Wesley Object Technology Series)
Unified Modeling Language User Guide, The (2nd Edition) (Addison-Wesley Object Technology Series)
Implementation of CTL model checker update
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
UML data models from an ORM (object-role modeling) perspective: data modeling at conceptual level
WSEAS Transactions on Information Science and Applications
Management and object behavior of statecharts through statechart DNA
WSEAS Transactions on Information Science and Applications
ICAI'09 Proceedings of the 10th WSEAS international conference on Automation & information
SVtL: system verification through logic tool support for verifying sliced hierarchical statecharts
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
ECC'10 Proceedings of the 4th conference on European computing conference
| Hi-index | 0.00 |
Simplified statecharts are derived by excluding all redundant constructs of the UML (Unified Modeling Language) metamodel on statecharts. In previous papers we introduced this basic concept and pointed out some interesting applications. We transformed and compacted state machines into serializable objects that clearly highlight their basic constructs and showed how a lot of sparse edges were created during this transformation. Sparse edges contain little or no information (e.g. empty transitions). From this compaction we derived a theory in which state machines are reduced to two distinct partial orderings on states. For the sake of convenience to read this paper, we briefly recapture part of this theory and show the exponentially growing complexity of calculating all possible values of variables that appear on state machine edges. In order to arrive at feasible algorithms leading to practical applications of the implicity complex partial ordering relations we need to reduce this complexity by formulating and proving reductions to state machine normal forms. Apart from aligning formal and behavioral equivalence, normal forms allow us to reduce the number of sparse edges and useless states thereby limiting calculational complexity. In this paper, we extend our theory with normal forms and inject them into the theory of simplified statecharts presented in earlier work. Some statecharts are only seemingly different from others if one analyzes the different paths in those statecharts. The UML is designed to allow for this kind of (uncontrollable) flexibility but in mathematical descriptions it has adverse effects. We introduce an equivalence relation on simplified statecharts and derive a normalization procedure which converts a simplified sc to a normalized simplified sc equivalent to the original one. Our formalism allows us to unravel superficial differences between simplified statecharts.