Learn More
We study encodings from CSP into asynchronous CCS with name passing and matching, so in fact, the asynchronous π-calculus. By doing so, we discuss two different ways to map the multi-way synchronisation mechanism of CSP into the two-way synchronisation mechanism of CCS. Both en-codings satisfy the criteria of Gorla except for compositionality, as both use(More)
We study the NP-hard Minimum Shared Edges (MSE) problem on graphs: decide whether it is possible to route p paths from a start vertex to a target vertex in a given graph while using at most k edges more than once. We show that MSE can be decided on bounded grids in linear time when both dimensions are either small or large compared to the number p of paths.(More)
  • 1