The matching of model to trace imposes a tree structure on the matched subgraph that corresponds to the model's hierarchical structure. It is this match tree that is displayed by AVE (Ariadne's Visualization Engine). For scalability, the tree is automatically compressed both horizontally and vertically: horizontally by eliding sibling nodes and vertically by pruning levels.

Due to the simplicity of the coarse-grained model, it is generally not possible to locate a program error simply by observing the matched tree. For this reason, AVE provides a spreadsheet-based query facility. The match tree visualization is treated as a spreadsheet interface, with each node containing a complex data structure. The elements of the complex data structure are called attributes of the abstract event. The user can perform queries on these attributes to gain more information than is available simply from the visualization.

Again, an example can be found in the tutorial.

prev next