Abstract
Recent geometric methods have been used in concurrency theory for quickly finding deadlocks and unreachable states, see [14] for instance. The reason why these methods are fast is that they contain in germ ingredients for tackling the state-space explosion problem. In this paper we show how this can be made formal. We also give some hints about the underlying algorithmics. Finally, we compare with other well-known methods for coping with the state-space explosion problem.
Cite
CITATION STYLE
Goubault, É., & Raussen, M. (2002). Dihomotopy as a tool in state space analysis tutorial. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2286, pp. 16–37). Springer Verlag. https://doi.org/10.1007/3-540-45995-2_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
