Reducing complex CSP models to traces via priority

DOI10.1016/j.entcs.2016.09.041zbMath1392.68310OpenAlexW2524715524WikidataQ113317631 ScholiaQ113317631MaRDI QIDQ1744391

A. W. Roscoe, David Mestel

Publication date: 23 April 2018

Full work available at URL: https://doi.org/10.1016/j.entcs.2016.09.041

zbMATH Keywords

priorityCSPdenotational semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Sound reasoning in \textit{tock}-CSP, Translating between models of concurrency

Uses Software

• FDR3
• Easychair

Cites Work

• Unnamed Item
• Refusal testing
• The pursuit of deadlock freedom
• Revivals, stuckness and the hierarchy of CSP models
• A calculus of mobile processes. I
• Understanding concurrent systems
• A singleton failures semantics for communicating sequential processes
• The expressiveness of CSP with priority
• Slow Abstraction via Priority
• A Second Course in Formal Languages and Automata Theory
• FDR3 — A Modern Refinement Checker for CSP