Identifying some bottlenecks of the concurrency workbench

Abstract

We present results which identify some of the bottlenecks of the Concurrency Workbench (CWB). Our results concentrate on the Minimize command which computes an agent with the smallest state space that is observation equivalent with a supplied agent. Measurements show that three major bottlenecks can be identified and that the performance of the CWB depends heavily on the amount of available primary memory