3D Layout of Reachability Graphs of Communicating Processes

Jéron, Thierry and Jard, Claude (1995) 3D Layout of Reachability Graphs of Communicating Processes. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 25-32 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_353).

Full text not available from this repository.

Abstract

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-determinisn, 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.

Item Type:Conference Paper
Additional Information:10.1007/3-540-58950-3_353
Classifications:Z Theory > Z.999 Others
P Styles > P.060 3D
ID Code:41

Repository Staff Only: item control page

References

Francoise André, Olivier Chéron, and Jean-Louis Pazat. Compiling Sequential Programs for Distributed Memory Parallel Computers with Pandore II. In J. J. Dongarra and B. Tourancheau, editors, Environments ans Tools for Parallel Scientific Computing, pages 293-308, Elsevier Science Publishers B. V., 1993. Also available as technical report IRISA (no. 651).

N. Bourbaki. Eléments de mathématique: Algèbre. Masson, 1981. Chap. 4-7.

CCITT. SDL, Recommendation Z.100. 1987.

G. Di Battista, P. Eades, H. de Fraysseix, P. Rosenthiel, and R. Tamassia, editors. Graph Drawing '93, the ALCOM International Workshop on Graph Drawing, Sèvres, Parc of Saint Cloud, Paris; September 1993.

G. Di Battista, P. Eades, and R. Tamassia. Algorithms for drawing graphs: an annotated bibliography. Draft document.

C. Diehl, C. Jard, and J.X. Rampon. Reachability analysis on distributed executions. In M.C. Gaudel and J.P. Jouannaud, editors, TAPSOFT, pages 629-643, Springer-Verlag, LNCS 668, Orsay, April 1993.

ISO 9074. Estelle: a Formal Description Technique based on an Extented State Transition Model. ISO TC97/SC21/WG6.1, 1989.

T. Jéron and C. Jard. 3D layout of reachability graphs of communicating processes. Technical Report 2334, INRIA, September 1994.

C. Jard, T. Jéron, G.-V. Jourdan, and J.-X. Rampon. A general approach to trace-checking in distributed computing systems. In The 14th International Conference on Distributed Computing Systems, Poznan, Poland, pages 396-403, IEEE Computer Society Press, June 1994.

K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. on Systems, Man and Cybernetics, SMC-11(2):109-125, 1981.