• antlr grammar
• deterministic network calculus
• dnc
• symbolic expressions
• visitor pattern

This work is a contribution to extend the software support for using Deterministic Network Calculus in both research and industry. Deterministic Network Calculus (DNC) is a mathematical framework for analysing performance guarantees in computer networks, such as the worst-case delay of a flow traversing a multi-hop network. A software library for computing single DNC operations already exists but lacks the possibility of capturing entire DNC symbolic expressions. By implementing this feature, the software would be able to analyse “top-to-bottom” the expression before making any computation and then apply possible optimization to reduce its complexity. Such a feature has been designed and implemented in the library result of this thesis, which describes it by a software engineering point-of-view. The implemented features allow the users to define, visualize, manipulate, reduce and compute DNC expressions.