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 , 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
URI: http://gdea.informatik.uni-koeln.de/id/eprint/41

Actions (login required)

View Item View Item