The expressiveness of CSP with priority

DOI10.1016/j.entcs.2015.12.023zbMath1351.68148OpenAlexW1793582516WikidataQ113317718 ScholiaQ113317718MaRDI QIDQ2520703

A. W. Roscoe

Publication date: 16 December 2016

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

zbMATH Keywords

operational semanticspriorityCSP

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (9)

Sound reasoning in \textit{tock}-CSP ⋮ A timed model for communicating sequential processes ⋮ Translating between models of concurrency ⋮ SAT-solving in CSP trace refinement ⋮ A brief history of Timed CSP ⋮ Reducing complex CSP models to traces via priority ⋮ A hierarchy of failures-based models: theory and application ⋮ The expressiveness of CSP with priority ⋮ The timed failures -- Stability model for CSP

Uses Software

• FDR3

Cites Work

• Unnamed Item
• Structural operational semantics for weak bisimulations
• Probabilistic and prioritized models of timed CSP
• Understanding concurrent systems
• The expressiveness of CSP with priority
• On the expressive power of CSP refinement
• Slow Abstraction via Priority
• Bisimulation can't be traced
• The meaning of negative premises in transition system specifications
• Precongruence formats for decorated trace semantics
• Theoretical Aspects of Computing – ICTAC 2005
• FDR3 — A Modern Refinement Checker for CSP

This page was built for publication: The expressiveness of CSP with priority