Specification and Proof in Real Time CSP
From MaRDI portal
Publication:4282003
DOI10.1017/CBO9780511569760zbMATH Open0820.68075OpenAlexW1985660652MaRDI QIDQ4282003FDOQ4282003
Publication date: 17 February 1994
Full work available at URL: https://doi.org/10.1017/cbo9780511569760
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Specification and verification (program logics, model checking, etc.) (68Q60) Collected or selected works; reprintings or translations of classics (01A75)
Cited In (7)
- Testing using CSP Models: Time, Inputs, and Outputs
- Specifying termination in CSP
- A brief history of Timed CSP
- Sound reasoning in \textit{tock}-CSP
- A CSP model with flexible parallel termination semantics
- A Proof-Based Method for Modelling Timed Systems
- Parameter synthesis for hierarchical concurrent real-time systems
Recommendations
- Specification and compositional verification of real-time systems π π
- A brief history of Timed CSP π π
- Correct Hardware Design and Verification Methods π π
- A refinement-based process algebra for timed automata π π
- Factorizing proofs in timed CSP π π
- A predicative semantics for the refinement of real-time systems π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
This page was built for publication: Specification and Proof in Real Time CSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4282003)