<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Finite-State-Machine on Pi Stack</title>
    <link>https://www.pistack.xyz/tags/finite-state-machine/</link>
    <description>Recent content in Finite-State-Machine on Pi Stack</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Sun, 21 Jun 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://www.pistack.xyz/tags/finite-state-machine/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Self-Hosted State Machine Libraries: XState vs Boost.SML vs Transitions</title>
      <link>https://www.pistack.xyz/posts/2026-06-21-state-machine-libraries-xstate-sml-transitions/</link>
      <pubDate>Sun, 21 Jun 2026 00:00:00 +0000</pubDate>
      <guid>https://www.pistack.xyz/posts/2026-06-21-state-machine-libraries-xstate-sml-transitions/</guid>
      <description>&lt;h2 id=&#34;introduction&#34;&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;State machines are one of the oldest and most reliable patterns in computer science — a system can be in exactly one state at a time, and explicit transitions define how it moves between states. This formalism prevents entire categories of bugs: impossible states become impossible to represent, race conditions between state transitions are eliminated by the single-state guarantee, and the system&amp;rsquo;s behavior becomes auditable and testable.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
