A Non-Standard Semantics for Kahn Networks in Continuous Time
Romain Beauxis (LIX, INRIA Saclay - Ile de France), Samuel Mimram (CEA, LIST)

TL;DR
This paper formalizes process network graphs, characterizes their categorical structure, and develops a continuous-time model using non-standard analysis, bridging discrete and infinitesimal time in process networks.
Contribution
It provides a formal definition of process network graphs, characterizes their categorical properties, and introduces a non-standard analysis-based continuous-time model for process networks.
Findings
Category of nets is a free fixpoint category.
Model incorporates infinitesimals via non-standard analysis.
Examples demonstrate applications in analysis and hybrid systems.
Abstract
In a seminal article, Kahn has introduced the notion of process network and given a semantics for those using Scott domains whose elements are (possibly infinite) sequences of values. This model has since then become a standard tool for studying distributed asynchronous computations. From the beginning, process networks have been drawn as particular graphs, but this syntax is never formalized. We take the opportunity to clarify it by giving a precise definition of these graphs, that we call nets. The resulting category is shown to be a fixpoint category, i.e. a cartesian category which is traced wrt the monoidal structure given by the product, and interestingly this structure characterizes the category: we show that it is the free fixpoint category containing a given set of morphisms, thus providing a complete axiomatics that models of process networks should satisfy. We then use these…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
