,
Giovanni Stea
Creative Commons Attribution 4.0 International license
Deterministic Network Calculus (DNC) provides a rigorous algebra for worst-case performance analysis of networks. It allows researchers to compute bounds on worst-case characteristics of systems through algebraic expressions that may appear simple on paper but often require heavy computations, making software support essential. Libraries such as Nancy offer a rich API for DNC computations in C#, but they require programming expertise. In contrast, RTaW’s min-plus playground (MPPG) provides a simpler, calculator-like syntax for DNC computations; however, it is proprietary and web-hosted, limiting offline use and reproducibility. We present nancy-playground, an open-source, locally runnable console that implements the same MPPG syntax while executing computations through the Nancy library. This tool enables reproducible scripting, interactive exploration, and a seamless transition to full programs by converting MPPG scripts into C# code. In this paper, we describe the design and implementation of nancy-playground, as well as its main features for researchers and practitioners in the DNC community.
@InProceedings{zippo_et_al:LIPIcs.ECRTS.2026.5,
author = {Zippo, Raffaele and Stea, Giovanni},
title = {{Nancy-Playground: A Console Calculator for Deterministic Network Calculus}},
booktitle = {38th European Conference on Real-Time Systems (ECRTS 2026)},
pages = {5:1--5:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-429-1},
ISSN = {1868-8969},
year = {2026},
volume = {375},
editor = {Kritikakou, Angeliki},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2026.5},
URN = {urn:nbn:de:0030-drops-265970},
doi = {10.4230/LIPIcs.ECRTS.2026.5},
annote = {Keywords: Deterministic Network Calculus, min-plus algebra, tooling}
}
archived version
archived version
archived version