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.
Cite
CITATION STYLE
Jéron, T., & Jard, C. (1995). 3D layout of reachability graphs of communicating processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 894, pp. 25–32). Springer Verlag. https://doi.org/10.1007/3-540-58950-3_353
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
