Reducing complex CSP models to traces via priority
type: Item
instance of: scholarly article
title: Reducing complex CSP models to traces via priority
zbMATH Open document ID: 1392.68310
author: David Mestel
author: A. W. Roscoe
publication date: 2018-04-23T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 6862932
zbMATH Keywords: CSP
zbMATH Keywords: denotational semantics
zbMATH Keywords: priority
Wikidata QID: Q113317631
describes a project that uses: FDR3
describes a project that uses: Easychair
MaRDI profile type: Publication
full work available at URL: j.entcs.2016.09.041
OpenAlex ID: W2524715524
cites work: A singleton failures semantics for communicating sequential processes
cites work: FDR3 — A Modern Refinement Checker for CSP
cites work: Q3777424
cites work: A calculus of mobile processes. I
cites work: Refusal testing
cites work: Revivals, stuckness and the hierarchy of CSP models
cites work: Understanding concurrent systems
cites work: The expressiveness of CSP with priority
cites work: The pursuit of deadlock freedom
cites work: Slow Abstraction via Priority
cites work: A Second Course in Formal Languages and Automata Theory
DOI: 10.1016/J.ENTCS.2016.09.041
description: scientific article; zbMATH DE number 6862932