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.












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)