Abstract
In this section, we explain algorithms which are based on the geometric semantics of programs. In order to ease the presentation, those algorithms are formulated for simple programs, and we only hint at generalizations: programs with branchings can generally be handled by adapting the algorithms, and loops can be handled up to a finite depth by unrolling the programs. We illustrate the wide variety of applications of the geometric point of view by presenting a compact way of representing regions in the geometric semantics, an algorithm for detecting deadlocks, and an algorithm for factoring programs into independent parallel processes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Fajstrup, L., Goubault, E., Haucourt, E., Mimram, S., Raussen, M. (2016). Algorithmics on Directed Spaces. In: Directed Algebraic Topology and Concurrency. Springer, Cham. https://doi.org/10.1007/978-3-319-15398-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-15398-8_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15397-1
Online ISBN: 978-3-319-15398-8
eBook Packages: Computer ScienceComputer Science (R0)