<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The Mathematical Specification of the Statebox Language · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1906.07629/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1906.07629/feed.xml" rel="self" type="application/rss+xml" /><item><title>The Mathematical Specification of the Statebox Language — mentioned by FabGenovese</title><link>https://news.ycombinator.com/item?id=25823436</link><guid isPermaLink="false">urn:hackerpapers:mention:1906.07629:25823436</guid><pubDate>Mon, 18 Jan 2021 16:34:50 GMT</pubDate><description>&lt;p&gt;The main difference is that a Petri net is basically an hypegraph, where you have directed edges connecting multiple vertexes both in the source and in the target. Graphs give you finite state machines in the obvious way: You mark the vertex you are in and walk the arrows. Hypergraphs give you Petri nets: You mark each vertex as many times as you want and walk the arrows to move marks around. This tells us two things: 1. Petri nets are a calculus of resources. The marking is not telling anymore &amp;quot;what state you are in&amp;quot;. A state is an allocation of resources to each vertex in the net. 2. Petri…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1906.07629/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item></channel></rss>
