论文信息 - 3D Layout of Reachability Graphs of Communicating Processes

3D Layout of Reachability Graphs of Communicating Processes

This paper presents a study about the 3D layout of some particular graphs. These graphs are finite reachability graphs of communicating processes. Some interesting semantical information which is present in the graph, such as concurrency, non-determinism, and membership of actions to processes are explicitly used in the layout. We start with the study of deterministic processes and give a conical representation which satisfies our requirements. Then we extrapolate our layout for non-deterministic processes.

Thierry Jéron | Claude Jard

[1] Ioannis G. Tollis,et al. Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[2] Jean-Louis Pazat,et al. Compiling sequential programs for distributed memory parallel computers with Pandore II , 1993 .

[3] Mitsuhiko Toda,et al. Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[4] Jean-Xavier Rampon,et al. Reachability Analysis on Distributed Executions , 1993, TAPSOFT.

[5] Thierry Jéron,et al. A general approach to trace-checking in distributed computing systems , 1994, 14th International Conference on Distributed Computing Systems.