Converted to Maven project

The code is converted to a Maven project.

Create and evaluate queueing networks

This library aims to provide a smooth approach for evaluating an M/M/C/K queueing network. By restricting the input to the adjacency matrix and the parameters that characterize the system, users are provided a straightforward approach to evaluating a queueing network without having to struggle with the details of the implementation. In this version (v1.1) a procedure is added to the uniformization method that avoids problems with variable underflow.

Create and evaluate queueing networks

This first release gives users a painless (as possible) experience when setting up the calculations for their, possibly time-dependent, queueing network. By restricting the input to the adjacency matrix and the basic parameters that characterize the system the user is free to evaluate their queueing network without having to struggle with too much coding and making a memory/time-efficient implementation.