The timed failures -- Stability model for CSP

DOI10.1016/S0304-3975(98)00214-XMaRDI QIDQ1274446zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A timed model for communicating sequential processes
• scientific article; zbMATH DE number 4011913
• On timed models and full abstraction
• An operational semantics for timed CSP
• Probabilistic and prioritized models of timed CSP

Cites work

• scientific article; zbMATH DE number 3902016 (Why is no real title available?)
• scientific article; zbMATH DE number 3902019 (Why is no real title available?)
• scientific article; zbMATH DE number 3956423 (Why is no real title available?)
• scientific article; zbMATH DE number 4011913 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 4050970 (Why is no real title available?)
• scientific article; zbMATH DE number 17696 (Why is no real title available?)
• A Theory of Communicating Sequential Processes
• A brief history of Timed CSP
• A hierarchy of domains for real-time distributed computing
• A timed model for communicating sequential processes
• An operational semantics for timed CSP
• Factorizing proofs in timed CSP
• Fixed points without completeness
• Probabilistic and prioritized models of timed CSP
• The expressiveness of CSP with priority

Cited in

(20)

• Probabilistic and prioritized models of timed CSP
• Compositional schedulability analysis of real-time actor-based systems
• Specifying termination in CSP
• Translating between models of concurrency
• A branching time model of CSP
• On timed models and full abstraction
• Refinement-preserving plug-in components
• A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA
• Bisimulation on speed: Worst-case efficiency
• An operational semantics for timed CSP
• Checking noninterference in timed CSP
• A timed model for communicating sequential processes
• Timed CSP = closed timed automata
• Behaviour approximated on subgroups
• scientific article; zbMATH DE number 7350777 (Why is no real title available?)
• A hierarchy of failures-based models: theory and application
• Unifying operational semantics with algebraic semantics for instantaneous reactions
• An Extended cCSP with Stable Failures Semantics
• scientific article; zbMATH DE number 4011913 (Why is no real title available?)
• The semantics and verification of timed service choreography

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1274446)