A feature-rich, yet simple finite state machine (FSM) implementation in C
-
Updated
Apr 11, 2019 - C
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 feature-rich, yet simple finite state machine (FSM) implementation in C
QP-nano real-time embedded framework/RTOS for embedded systems based on active objects (actors) and hierarchical state machines
DFA regular expression library & friends
Statechart library and editor
Communicating Sequential Processes in Lua
Button Driver for Tactile Switches Buttons Compatible with ESP-IDF and STM32CubeIDE
yacup: Yet Another C Utilities Package
A Minimalist Asynchronous Toolkit (AMAST) is a small and efficient C99 library that helps manage complex, event-driven programs. It combines the Actor model with hierarchical state machines to make building real-time systems easier.
Lightweight State Machine Framework in C
Simple and tiny framework of a synchronous, non-hierarchical, finite state maschine to manage system states
An oscilloscope capturing data from Ethernet and graphing it alongside with Fourier Transform
This is an implementation of c's famous printf function. It uses system calls, pointer, functions, structs, loops, conditions, finite state machines and so much more. The purpose is to have a better understanding of the printf function and appreciate the complexities of the builtin function.