scientific article; zbMATH DE number 4052987

MaRDI QIDQ3789045zbMATH OpenFDO

Authors R. K. Shyamasundar

Publication date 1988

zbMATH Keywords

communicating sequential processescommunication complexityCSPdistributed programsproof systemstime-complexity of sequential programs

Mathematics Subject Classification ID

Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 3903944
• scientific article; zbMATH DE number 3890704
• scientific article; zbMATH DE number 3963180
• scientific article; zbMATH DE number 3878340
• Proof principles of CSP -- CSP-prover in practice

Cited in

(1)

• scientific article; zbMATH DE number 3846835 (Why is no real title available?)

This page was built for publication:

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