arXiv — Machine Learning · · 3 min read

Relaxed activation analysis of dataflow networks - A clock calculus for machine learning and real-time scheduling

Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.

Computer Science > Programming Languages

arXiv:2607.21797 (cs)
[Submitted on 23 Jul 2026]

Title:Relaxed activation analysis of dataflow networks - A clock calculus for machine learning and real-time scheduling

View a PDF of the paper titled Relaxed activation analysis of dataflow networks - A clock calculus for machine learning and real-time scheduling, by William Gaudelier and 2 other authors
View PDF HTML (experimental)
Abstract:Previous work has shown that the simple dataflow primitives of the Lustre language allow the natural, semantically unambiguous, and compact representation of machine learning (ML) applications, including models featuring complex conditional execution and recurrent state. The Lustre clock calculus is responsible for the static determination of important properties such as liveness (absence of deadlocks) and static memory bounds. Yet existing clock calculi are tailored for embedded control applications. We show they do not cater for the representation of control patterns commonly found in training algorithms, resulting in cumbersome expressions and inefficient compilation. We propose a conservative extension of Lustre's clock calculus addressing this limitation, thereby facilitating the embedding of ML models in reactive applications.
Subjects: Programming Languages (cs.PL); Machine Learning (cs.LG)
Cite as: arXiv:2607.21797 [cs.PL]
  (or arXiv:2607.21797v1 [cs.PL] for this version)
  https://doi.org/10.48550/arXiv.2607.21797
arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Albert Cohen [view email]
[v1] Thu, 23 Jul 2026 20:27:08 UTC (115 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Relaxed activation analysis of dataflow networks - A clock calculus for machine learning and real-time scheduling, by William Gaudelier and 2 other authors
  • View PDF
  • HTML (experimental)
  • TeX Source

Current browse context:

cs.PL
< prev   |   next >
Change to browse by:

References & Citations

Loading...

BibTeX formatted citation

loading...
Data provided by:

Bookmark

BibSonomy Reddit
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from arXiv — Machine Learning