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-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 is an Inria researcher and Claude Jard a Cnrs researcher
This work has been supported in part by the French Ministère de l'Enseignement Supérieur et de la Recherche under the grant Trace and by the French-Israeli cooperation.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Françoise 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 and 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. Rosentiehl, 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 14 th 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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jéron, T., Jard, C. (1995). 3D layout of reachability graphs of communicating processes. In: Tamassia, R., Tollis, I.G. (eds) Graph Drawing. GD 1994. Lecture Notes in Computer Science, vol 894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58950-3_353
Download citation
DOI: https://doi.org/10.1007/3-540-58950-3_353
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58950-1
Online ISBN: 978-3-540-49155-2
eBook Packages: Springer Book Archive