Proof systems for message-passing process algebras

Formal Aspects of Computing

Volumn 8, Issue 4, 1996, Pages 379-407

  Hennessy, M ^a   Lin, H ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

Bisimulation equivalence; Completeness; Message passing; Process algebra; Proof system; Symbolic semantics

Indexed keywords

ALGEBRA;

ALGEBRAIC SEMANTIC; BOOLEAN EXPRESSION; COMPLETENESS; MESSAGE TRANSMISSION; PROCESS; PROCESS ALGEBRA; PROOF THEORY; SYMBOLIC LANGUAGE;

COMMUNICATION;

EID: 0030366211     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01213531     Document Type: Article

References (17)

1. Burns, G. A language for value-passing ces. Technical Report ECS-LFCS-91-175, University of Edinburgh, August 1991.
2. Cleaveland, R., Parrow, J., Steffen, B. The concurrency workbench: A semantics based verification tool for finite state systems. ACM Transactions on Programming Systems, 15:36-72, 1989.
3. Groote, J.F., Ponse, A. The syntax and semantics of μCRL. Technical Report CS-R9076, CWI, Amsterdam, 1990.
4. Groote, J.F., Ponse, A. Proof theory for μCRL. Technical Report CS-R9138, CWI, Amsterdam, 1991.
5. Hennessy, M. An Algebraic Theory of Processes. MIT Press, 1988.
6. Hennessy, M. A proof system for communicating processes with value-passing. Formal Aspects of Computer Science, 3:346-366, 1991.
7. Hennessy, M., Ingolfsdottir, A. A theory of communicating processes with value-passing. Information and Computation, 107(2):202-236, 1993.
8. Hennessy, M. Lin, H. Symbolic bisimulations. Theoretical Computer Science, 138:353-389,1995.
9. Hennessy, M. Liu, X. A modal logic for message passing processes. Acta Informatica, 32:375-393, 1995.
10. Hoare, C.A.R., Roscoe, A.W. The laws of occam. Technical Report PRG Monograph 53, Oxford University Computing Laboratory, 1986.
11. Lin, H. PAM: A process algebra manipulator. In K. Larsen and A. Skou, editors, Computer Aided Verification, volume 575 of Lecture Notes in Computer Science, pages 136-146. Springer-Verlag, 1991. Also available as Sussex Computer Science Technical Report 9/91.
12. th International Symposium on Protocol Specification, Testing Verification, IFIP Transactions. North-Holland, 1993.
13. Milner, R. Communication and Concurrency. Prentice-Hall, 1989.
14. Milner, R., Parrow, J., Walker, D. A calculus of mobile proceses, part i. Information and Computation, 100(1):1-40, 1992.
15. Parrow, J., Sangiorgi, D. Algebraic theories for value-passing calculi. Technical report. University of Edinburgh, 1993. Also Technical Report from SICS, Sweden. To appear in Information and Computation.
16. Parrow, J., Sangiorgi, D. Algebraic theories for value-passing calculi. Technical report. University of Edinburgh, 1993. Also Technical Report from SICS, Sweden. To appear in Information and Computation.
17. Walker, D. Automated analysis of mutual exclusion algorithms using CCS. Formal Aspects of Computing, 1:273-292, 1989.