The expressiveness of CSP with priority
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- Bisimulation can't be traced
- FDR3 -- a modern refinement checker for CSP
- On the expressive power of CSP refinement
- Precongruence formats for decorated trace semantics
- Probabilistic and prioritized models of timed CSP
- Slow abstraction via priority
- Structural operational semantics for weak bisimulations
- The expressiveness of CSP with priority
- The meaning of negative premises in transition system specifications
- Theoretical Aspects of Computing – ICTAC 2005
- Understanding concurrent systems
Cited in
(15)- On the expressibility of priority
- scientific article; zbMATH DE number 1421069 (Why is no real title available?)
- Translating between models of concurrency
- A brief history of Timed CSP
- Reducing complex CSP models to traces via priority
- Sound reasoning in \textit{tock}-CSP
- SAT-solving in CSP trace refinement
- The timed failures -- Stability model for CSP
- A timed model for communicating sequential processes
- The expressiveness of CSP with priority
- A hierarchy of failures-based models: theory and application
- An expressiveness study of priority in process calculi
- On the expressive power of CCS
- The expressive power of CHR with priorities
- CSP is expressive enough for \(\pi\)
This page was built for publication: The expressiveness of CSP with priority
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2520703)