The timed failures -- Stability model for CSP

DOI10.1016/S0304-3975(98)00214-XzbMath0912.68038OpenAlexW4212934768MaRDI QIDQ1274446

G. M. Reed, A. W. Roscoe

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00214-x

zbMATH Keywords

semanticsnondeterminismtimed CSPmetric domains

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items (13)

Unifying Operational Semantics with Algebraic Semantics for Instantaneous Reactions ⋮ Bisimulation on speed: Worst-case efficiency ⋮ Translating between models of concurrency ⋮ Unnamed Item ⋮ Specifying termination in CSP ⋮ Checking noninterference in timed CSP ⋮ Probabilistic and prioritized models of timed CSP ⋮ Compositional schedulability analysis of real-time actor-based systems ⋮ Refinement-Preserving Plug-In Components ⋮ A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA ⋮ Behaviour approximated on subgroups ⋮ Timed CSP = Closed Timed Automata1 ⋮ The semantics and verification of timed service choreography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A brief history of Timed CSP
• Fixed points without completeness
• Probabilistic and prioritized models of timed CSP
• A timed model for communicating sequential processes
• An operational semantics for timed CSP
• The expressiveness of CSP with priority
• A Theory of Communicating Sequential Processes
• A hierarchy of domains for real-time distributed computing
• Factorizing proofs in timed CSP

This page was built for publication: The timed failures -- Stability model for CSP