Journal article icon

Journal article

Static Livelock Analysis in CSP

Abstract:

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 through a static analysis of their syntax. In particular, we present a collection of rules, based on the inductive structure of terms, which guarantee livelock-freedom of the denoted process. This...

Expand abstract
Publication status:
Published

Actions


Access Document


Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
Journal:
CONCUR 2011: CONCURRENCY THEORY
Volume:
6901
Pages:
389-403
Publication date:
2011-01-01
DOI:
EISSN:
1611-3349
ISSN:
0302-9743
URN:
uuid:9ccd8c9d-5eea-44ef-b31c-23d037d8c566
Source identifiers:
305625
Local pid:
pubs:305625
Language:
English

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP