On execution spaces of PV-programs
From MaRDI portal
Abstract: Semaphores were introduced by Dijkstra as a tool for modeling concurrency in computer programs. In this paper we provide a formal definition of PV-programs, i.e. programs using semaphores, their state spaces and execution spaces. The main goal of this paper is to prove that every finite homotopy type may appear as a connected component of the execution space of a PV-program.
Recommendations
Cites work
- A cubical model for path spaces in d-simplicial complexes
- Abstract Regular Polytopes
- Algebraic topology and concurrency
- Combinatorial algebraic topology
- Components of the fundamental category
- Directed algebraic topology. Models of non-reversible worlds
- Execution spaces for simple higher dimensional automata
- Homology of spaces of directed paths on Euclidean cubical complexes
- scientific article; zbMATH DE number 2051884 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- On the expressiveness of higher dimensional automata (extended abstract)
- Simplicial Models for Concurrency
- Simplicial models of trace spaces
- Trace spaces in a pre-cubical complex
Cited in
(10)- Combinatorial conditions for directed collapsing
- Connectivity of spaces of directed paths in geometric models for concurrent computation
- The geometry of timed PV programs
- Homology of Spaces of Directed Paths in Euclidean Pattern Spaces
- Inessential directed maps and directed homotopy equivalences
- Towards directed collapsibility (research)
- Directed path spaces via discrete vector fields
- Spaces of directed paths on pre-cubical sets
- On the topology of concurrent systems
- Directed homology and persistence modules
This page was built for publication: On execution spaces of PV-programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5964017)