Static Livelock Analysis in CSP
From MaRDI portal
Publication:3090843
DOI10.1007/978-3-642-23217-6_26zbMath1300.68036MaRDI QIDQ3090843
A. W. Roscoe, James Worrell, Hristina Palikareva, Joël Ouaknine
Publication date: 2 September 2011
Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:5dccc8db-e017-440f-95ea-49e02984d13f
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong normalisation in the \(\pi\)-calculus
- The behavioural semantics of Event-B refinement
- Understanding concurrent systems
- A Static Analysis Framework for Livelock Freedom in CSP
- Processes and the denotational semantics of concurrency
- Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement
- A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems