A finite-state machine (FSM), finite-state automaton (FSA), or simply state machine is a mathematical model of computation and an abstract machine that can be in exactly one of a finite number of states at any given time.
The FSM can change from one state to another in response to some inputs; the change from one state to another is called a transition.
An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition.
In computer science, FSM are widely used in modeling of application behavior (control theory), design of hardware digital systems, software engineering, compilers, network protocols, and computational linguistics.
A simple Java statemachine for Spring Boot projects
Toolset to capture, simulate, synthesize and verify graph models
An FSM that manages async non-blocking access to a Netty Channel
The engine module is for the TenIO framework.
A library that implements formal finite state automata.
A declarative DSL for building asynchronously evaluated Finite State Machines on the JVM
是一款灵感来源于 cola-statemachine 与 spring-statemachine 的FSM状态机实现，专为追求极致性能与简洁设计的开发者而生的java库;快运用到你的项目中让你的业务逻辑更佳优雅吧！
squirrel-foundation is a State Machine library, which provided a lightweight, easy use, type safe and programmable state machine implementation for Java.
Finite-State Machines for Java
Type-safe abstract trait recorder for 'finite state automata'-like agent
Lightweight Java State Machine
A simple state machine library.
个人代码块
Some Android APIs testing.