research-article

Open access

A proof system for communicating processes with value-passing

Author:

M. HennessyAuthors Info & Claims

Formal Aspects of Computing, Volume 3, Issue 4

Pages 346 - 366

https://doi.org/10.1007/BF01642508

Published: 01 October 1991 Publication History

PDF eReader

Abstract

A proof system for a version of CCS with value-passing is proposed in which the reasoning about data is factored out from that about the structure of processes. The system is shown to be sound and complete for finite terms with respect to a denotational semantics based on Acceptance Trees.

References

[1]

Apt K. Diaz M. Proving Correctness of CSP Programs — A tutorial 1986 Amsterdam North-Holland 73-84

Google Scholar

[2]

Dijkstra E. W. A Discipline of Programming 1976 Englewood Cliffs Prentice Hall

Digital Library

Google Scholar

[3]

Hennessy M. Acceptance Trees Journal of the ACM 1985 32 4 896-928

Digital Library

Google Scholar

[4]

Hennessy M. Algebraic Theory of Processes 1988 Cambridge MIT Press

Digital Library

Google Scholar

[5]

Hennessy, M and Ingolfsdottir, A.: A Theory of Communicating Processes with Value-passing. University of Sussex Technical Report No 3/89, 1989. Also presented at ICALP '90.

Google Scholar

[6]

Hoare C. A. R. Communicating Sequential Processes Communications of ACM 1978 21 8 666-677

Digital Library

Google Scholar

[7]

Hoare C. A. R. Communicating Sequential Processes 1985 London Prentice-Hall International

Digital Library

Google Scholar

[8]

Hoare, C. A. R. and Roscoe, A. W.: The Laws of Occam. PRG Monograph, Oxford University, 1986. (Also published inTheoretical Computer Science)

Google Scholar

[9]

Milne, R.: Concurrency Models and Axioms. RAISE/STC/REM/6/V2, STC Technology Ltd., 1988.

Google Scholar

[10]

Milner R. A Calculus of Communicating Systems Lecture Notes in Computer Science 92 1980 Berlin Springer-Verlag

Digital Library

Google Scholar

[11]

Milner R. Calculus for Communication and Concurrency 1989 London Prentice-Hall

Google Scholar

Cited By

View all

Ceragioli LGadducci FLomurno GTedeschi G(2024)Quantum Bisimilarity via Barbs and Contexts: Curbing the Power of Non-deterministic ObserversProceedings of the ACM on Programming Languages10.1145/36328858:POPL(1269-1297)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632885
Wu HYang QLong H(2024)Branching bisimulation semantics for quantum processesInformation Processing Letters10.1016/j.ipl.2024.106492186:COnline publication date: 17-Jul-2024
https://dl.acm.org/doi/10.1016/j.ipl.2024.106492
(2016)Theory of interactionTheoretical Computer Science10.1016/j.tcs.2015.07.043611:C(1-49)Online publication date: 18-Jan-2016
https://dl.acm.org/doi/10.1016/j.tcs.2015.07.043
Show More Cited By

Index Terms

A proof system for communicating processes with value-passing

Index terms have been assigned to the content through auto-classification.

Recommendations

A complete proof system for propositional projection temporal logic

The paper presents a proof system for Propositional Projection Temporal Logic (PPTL) with projection-plus. The syntax, semantics, and logical laws of PPTL are introduced together with an axiom system consisting of axioms and inference rules. To ...
Completeness and decidability of converse PDL in the constructive type theory of Coq
CPP 2018: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs

The completeness proofs for Propositional Dynamic Logic (PDL) in the literature are non-constructive and usually presented in an informal manner. We obtain a formal and constructive completeness proof for Converse PDL by recasting a completeness proof ...
Proof systems for message-passing process algebras
Abstract
We give sound and complete proof systems for a variety of bisimulation based equivalences over a message-passing process algebra. The process algebra is a generalisation of pureCCS where the actions consist of receiving and sending messages or ...

Comments

Information & Contributors

Information

Published In

Formal Aspects of Computing Volume 3, Issue 4

Oct 1991

66 pages

ISSN:0934-5043

EISSN:1433-299X

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 October 1991

Accepted: 15 February 1991

Received: 15 July 1990

Published in FAC Volume 3, Issue 4

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

41
Total Citations
View Citations
42
Total Downloads

Downloads (Last 12 months)17
Downloads (Last 6 weeks)1

Reflects downloads up to 27 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ceragioli LGadducci FLomurno GTedeschi G(2024)Quantum Bisimilarity via Barbs and Contexts: Curbing the Power of Non-deterministic ObserversProceedings of the ACM on Programming Languages10.1145/36328858:POPL(1269-1297)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632885
Wu HYang QLong H(2024)Branching bisimulation semantics for quantum processesInformation Processing Letters10.1016/j.ipl.2024.106492186:COnline publication date: 17-Jul-2024
https://dl.acm.org/doi/10.1016/j.ipl.2024.106492
(2016)Theory of interactionTheoretical Computer Science10.1016/j.tcs.2015.07.043611:C(1-49)Online publication date: 18-Jan-2016
https://dl.acm.org/doi/10.1016/j.tcs.2015.07.043
Garavel H(2015)Revisiting sequential composition in process calculiJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2015.08.00184:6(742-762)Online publication date: Nov-2015
https://doi.org/10.1016/j.jlamp.2015.08.001
Fu Y(2013)The value-passing calculusTheories of Programming and Formal Methods10.5555/2554641.2554652(166-195)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.5555/2554641.2554652
Fu Y(2013)The Value-Passing CalculusTheories of Programming and Formal Methods10.1007/978-3-642-39698-4_11(166-195)Online publication date: 2013
https://doi.org/10.1007/978-3-642-39698-4_11
Feng YDuan RYing M(2012)Bisimulation for Quantum ProcessesACM Transactions on Programming Languages and Systems10.1145/2400676.240068034:4(1-43)Online publication date: 1-Dec-2012
https://dl.acm.org/doi/10.1145/2400676.2400680
Huang SCao YWang HQu W(2012)Value-passing CCS with noisy channelsTheoretical Computer Science10.1016/j.tcs.2012.03.002433(43-59)Online publication date: 1-May-2012
https://dl.acm.org/doi/10.1016/j.tcs.2012.03.002
Deng YFeng Y(2012)Open bisimulation for quantum processesProceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science10.1007/978-3-642-33475-7_9(119-133)Online publication date: 26-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-33475-7_9
Feng YDuan RYing MBall TSagiv M(2011)Bisimulation for quantum processesProceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/1926385.1926446(523-534)Online publication date: 26-Jan-2011
https://dl.acm.org/doi/10.1145/1926385.1926446
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

References

Cited By

Index Terms

Recommendations

A complete proof system for propositional projection temporal logic

Completeness and decidability of converse PDL in the constructive type theory of Coq

Proof systems for message-passing process algebras

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations