ERS

ERS: a tool set for performance evaluation of discrete event systems. ERS contains tools for: creating graphical representations of some discrete event systems: Petri Nets (snapshot), Task Graphs, Heaps of Pieces (snapshot), Interaction Graphs. analyzing the systems and computing performance measures (throughputs and growth rates, waiting times, makespans etc.) transforming systems from one representation to another.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 2 articles )

Showing results 1 to 2 of 2.
Sorted by year (citations)

  1. Benoit, Anne; Gallet, Matthieu; Gaujal, Bruno; Robert, Yves: Computing the throughput of probabilistic and replicated streaming applications (2014)
  2. Krob, Daniel; Mairesse, Jean; Michos, Ioannis: Computing the average parallelism in trace monoids. (2003)