%0 Conference Paper %1 weidl_97_facilitating %A Weidl, J. %A Klosch, R. R. %A Trausmuth, G. %A Gall, H. %D 1997 %J Program Comprehension, 1997. IWPC '97. Proceedings., Fifth Iternational Workshop on %K 1997 patterns statecharts %P 118--127 %R 10.1109/WPC.1997.601277 %T Facilitating program comprehension via generic components for state machines %U http://dx.doi.org/10.1109/WPC.1997.601277 %X Various applications use state transition mechanisms as a major building block. As an example, finite state machines (FSMs) and their graphical counterpart-state transition diagram-are heavily used e.g. for the specification of various kinds of protocols such as network protocols (e.g. TCP/IP), protocols for infrared data transmission, etc. Many embedded systems, such as telephone switching systems and television control, are directly based on state machines. Introducing generic components for state machines can raise the source code abstraction level from “hard coded” control flow decisions such as “switch/case” and “if” to a more flexible implementation model of control flow. The paper shows that it is possible to use statecharts and their advanced mechanisms from specification to implementation of reactive systems. By explicitly modeling states and state transitions the source code is described at a higher abstraction level and thereby top down program comprehension is facilitated. We define a set of specific design patterns to abstract state machine source code from low level implementation to a more abstract level. Furthermore, we introduce a certain degree of genericity and thus flexibility without major losses in efficiency during the design and implementation of generic components

@inproceedings{weidl_97_facilitating, abstract = {Various applications use state transition mechanisms as a major building block. As an example, finite state machines (FSMs) and their graphical counterpart-state transition diagram-are heavily used e.g. for the specification of various kinds of protocols such as network protocols (e.g. TCP/IP), protocols for infrared data transmission, etc. Many embedded systems, such as telephone switching systems and television control, are directly based on state machines. Introducing generic components for state machines can raise the source code abstraction level from “hard coded” control flow decisions such as “switch/case” and “if” to a more flexible implementation model of control flow. The paper shows that it is possible to use statecharts and their advanced mechanisms from specification to implementation of reactive systems. By explicitly modeling states and state transitions the source code is described at a higher abstraction level and thereby top down program comprehension is facilitated. We define a set of specific design patterns to abstract state machine source code from low level implementation to a more abstract level. Furthermore, we introduce a certain degree of genericity and thus flexibility without major losses in efficiency during the design and implementation of generic components}, added-at = {2009-02-11T22:21:25.000+0100}, author = {Weidl, J. and Klosch, R. R. and Trausmuth, G. and Gall, H.}, biburl = {https://www.bibsonomy.org/bibtex/270f5ca7d76eca76812d9f0b217555afb/leonardo}, citeulike-article-id = {1123116}, doi = {10.1109/WPC.1997.601277}, interhash = {f0af5fb2f88894946e3e3bfb3fa6fafb}, intrahash = {70f5ca7d76eca76812d9f0b217555afb}, journal = {Program Comprehension, 1997. IWPC '97. Proceedings., Fifth Iternational Workshop on}, keywords = {1997 patterns statecharts}, pages = {118--127}, posted-at = {2007-02-26 15:42:51}, priority = {4}, timestamp = {2009-02-11T22:21:25.000+0100}, title = {Facilitating program comprehension via generic components for state machines}, url = {http://dx.doi.org/10.1109/WPC.1997.601277}, year = 1997 }