<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Categories of Nets · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2101.04238/</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/2101.04238/feed.xml" rel="self" type="application/rss+xml" /><item><title>Categories of Nets — mentioned by taliesinb</title><link>https://news.ycombinator.com/item?id=28538690</link><guid isPermaLink="false">urn:hackerpapers:mention:2101.04238:28538690</guid><pubDate>Wed, 15 Sep 2021 13:17:31 GMT</pubDate><description>&lt;p&gt;Some of the ideas in this post might pan out, some might not. Regardless, I do think token event graphs will turn out to be important. Of course, I&amp;#x27;m biased: I coined the name TEG -- although the underlying idea originated with Max Piskunov and his &amp;quot;local multiway systems&amp;quot; [0] What&amp;#x27;s promising about TEGs (and their incidence hypergraph, the rewrite hypergraph) is that they offer a clean methodology to decompose the behavior of a non-deterministic automaton into its causally independent parts. We&amp;#x27;re still trying to understand how to think about them, but the most promising approach seems to…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2101.04238/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.CT</category></item></channel></rss>
