Dynamic State Machine for Reactive Systems Modeling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional finite state machines (FSMs) and statecharts have limitations such as lack of memory, inability to support dynamic creation of child FSMs, and complexity in handling composite transitions and parallel-or composite states, which restrict their ability to model complex reactive systems and protocols in distributed computing environments.
Innovation Solution
The introduction of a dynamic state machine (DSM) that integrates a root FSM and its nested child FSMs into a single entity, supporting composite transitions and parallel-or composite states, allowing for dynamic creation of child FSMs and handling multiple concurrent sessions, thereby enhancing the capability to model complex reactive systems and protocols.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If pure FSM is used to model reactive systems, then the model is simple and easy to understand, but it lacks memory and cannot represent historical changes or counters
Solution Approach 1:
The patent embeds data variables within states of the FSM, creating a nested structure where states contain both control information and data information. This allows the simple FSM framework to gain memory capability without changing its fundamental structure, resolving the contradiction between simplicity and adaptability.
2Adaptability or versatility
If EFSMs are used to add memory to FSM, then the model can represent counters and historical changes, but the model complexity increases
Solution Approach 1:
The patent segments the state model into distinct components: states, transitions, and data variables. This segmentation allows memory functionality to be added through data variables without complicating the state transition logic, maintaining model clarity while increasing adaptability.
3Device complexity
If statecharts are used to reduce the number of states through hierarchical structure, then the model becomes more organized, but it does not support dynamic creation of child FSMs at runtime
Solution Approach 1:
The patent introduces dynamic state machines that can be instantiated and created at runtime based on system needs. This dynamic approach allows the hierarchical structure to be established and modified during execution, combining the organizational benefits of statecharts with the flexibility of dynamic creation.
4Device complexity
If traditional FSM supports only simple transitions with single events, then the model is easy to read and understand, but it cannot handle composite transitions requiring logical combinations of events
Solution Approach 1:
The patent combines multiple events and conditions into composite transitions, creating a new transition type that integrates simple transition clarity with complex event handling capability. This composite transition structure allows logical combinations of events while maintaining model readability through structured notation.
Data Source
AI summary
A method for specifying reactive systems using Dynamic State Machines (DSMs) is disclosed. The method extends statecharts in three areas. One is the integration of a group of related finite state machines (FSMs) into a single and powerful entity supporting multiple repeatable concurrent communication sessions. The second is the support for composite transitions to model various parallel event patterns or nested event patterns, which occur in the real world, and to significantly improve the readability of state diagrams. The third is the addition of a parallel-OR composite state to support the OR-termination semantics of a parallel composite state.