Advertisement

3D layout of reachability graphs of communicating processes

  • Thierry Jéron
  • Claude Jard
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 894)

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.

Keywords

Reachable State Label Transition System Reachability Graph Loop Edge FIFO Channel 
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

  1. [ACP93]
    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).Google Scholar
  2. [Bou81]
    N. Bourbaki. Eléments de mathématique: Algèbre. Masson, 1981. Chap. 4–7.Google Scholar
  3. [CCI87]
    CCITT. SDL, Recommendation Z.100. 1987.Google Scholar
  4. [DBEdF*93]
    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.Google Scholar
  5. [DBET]
    G. Di Battista, P. Eades, and R. Tamassia. Algorithms for drawing graphs: an annotated bibliography. Draft document.Google Scholar
  6. [DJR93]
    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.Google Scholar
  7. [ISO89]
    ISO 9074. Estelle: a Formal Description Technique based on an Extented State Transition Model. ISO TC97/SC21/WG6.1, 1989.Google Scholar
  8. [JJ94]
    T. Jéron and C. Jard. 3D layout of reachability graphs of communicating processes. Technical Report 2334, INRIA, September 1994.Google Scholar
  9. [JJJR94]
    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.Google Scholar
  10. [STT81]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Thierry Jéron
    • 1
  • Claude Jard
    • 1
  1. 1.Campus de BeaulieuIRISARennes CedexFrance

Personalised recommendations