Fast Graph Generation for Synchronous Processes
Chris Tofts, Chris Tofts · 2002
The automated analysis of concurrent systems requires that they are translated from a syntactic presentation into some semantic space. One common space of interpretation is transition systems [2, 4]. In particular situations it is possible to produce these transformations piecewise, but in general we need to produce the complete system graph in order to analyse it. Performing this task efficiently is clearly important for the practicality of automated systems analysis. We present some techniques that greatly reduce the cost of generating graphs from synchronous presentations of concurrent systems. These methods have been implemented within an analysis tool the probabilistic workbench (PRWB)[7].