scientific article

zbMath0594.68025MaRDI QIDQ3725534

G. M. Reed, A. W. Roscoe

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

CSPproof systemssemantic operatorsparallelim

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (24)

Recursion induction for real-time processes ⋮ Unbounded nondeterminism in CSP ⋮ Time abstracted bisimulation: Implicit specifications and decidability ⋮ Processes with probabilities, priority and time ⋮ Time-abstracted bisimulation: Implicit specifications and decidability ⋮ A timed model for communicating sequential processes ⋮ Compositional verification of real-time systems with explicit clock temporal logic ⋮ Towards a complete hierarchy of compositional dataflow models ⋮ A process algebra of communicating shared resources with dense time and priorities ⋮ revTPL: The Reversible Temporal Process Language ⋮ Timewise refinement for communicating processes ⋮ Finite divergence ⋮ A brief history of Timed CSP ⋮ Fixed points without completeness ⋮ The fixed-point theory of strictly causal functions ⋮ An introduction to compositional methods for concurrency and their application to real-time. ⋮ Behavioural abstraction in TCCS ⋮ A Timed Process Algebra for Wireless Networks with an Application in Routing ⋮ TIC: a tImed calculus ⋮ The timed failures -- Stability model for CSP ⋮ An efficiency preorder for processes ⋮ Timed CSP = Closed Timed Automata1 ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions ⋮ An efficiency preorder for processes

This page was built for publication: