A Static Analysis Framework for Livelock Freedom in CSP
In a process algebra with hiding and recursion it is possible to create processes which compute internally without ever communicating with their environment. Such processes are said to diverge or livelock. In this paper we show how it is possible to conservatively classify processes as livelock-free...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Published: |
2013
|