Advertisement

Proof systems for cause based equivalences

  • Astrid Kiehn
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 711)

Abstract

Two proof systems for the congruences of causal bisimulation and location equivalence of finite CCS are proposed. They generalize the known axiomatizations for restriction free processes which are based on the two merge operators of ACP. Since the proof systems only differ in three equations they provide a simple means of comparison.

Keywords

Normal Form Transition System Operational Semantic Proof System Visible Action 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    L. Aceto. Action Refinement in Process Algebra. Ph.d. thesis, University of Sussex, 1991.Google Scholar
  2. 2.
    L. Aceto. A static view of localities. Report 1483, INRIA, 1991.Google Scholar
  3. 3.
    L. Aceto. Relating distributed, temporal and causal observations of simple processes. Technical Memo HPL-PSC-92-32, Hewlett-Packard Laboratories, Pisa Science Center, 1992.Google Scholar
  4. 4.
    J. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, (37):77–121, 1985.Google Scholar
  5. 5.
    G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. Observing localities. Report 4/91, University of Sussex, 1991. Extended abstract in the proceedings of MFCS 91, LNCS 520.Google Scholar
  6. 6.
    G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. A theory of processes with localities. Report 13/91, University of Sussex, 1991. Extended abstract in the proceedings of CONCUR 92.Google Scholar
  7. 7.
    P. Darondeau and P. Degano. Causal trees. In Proceedings of ICALP 88, number 372 in Lecture Notes in Computer Science, pages 234–248, 1989.Google Scholar
  8. 8.
    P. Degano, R. De Nicola, and U. Montanari. Universal axioms for bisimulations. Report TR-9/92, University of Pisa, 1992.Google Scholar
  9. 9.
    P. Degano and C. Priami. Proved trees. In W. Kuich, editor, Proceedings of ICALP 92, number 623 in Lecture Notes in Computer Science, pages 629–640. Springer-Verlag, 1992.Google Scholar
  10. 10.
    G. Ferrari, R. Gorrieri, and U. Montanari. Parametric laws for concurrency. In Proceedings of Tapsoft 91, number 494 in Lecture Notes in Computer Science, 1991.Google Scholar
  11. 11.
    M. Hennessy. Axiomatising finite concurrent processes. SIAM Journal of Computing, 17(5):997–1017, 1988.Google Scholar
  12. 12.
    M. Hennessy. A proof system for weak ST-bisimulation over a finite process algebra. Report 6/91, University of Sussex, 1991.Google Scholar
  13. 13.
    M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computing Machinery, 32(1):137–161, 1985.Google Scholar
  14. 14.
    A. Kiehn. Comparing locality and causality based equivalences (Revision of: Local and global causes. Report TUM-I9132, Technische Universität München, 1992).Google Scholar
  15. 15.
    A. Kiehn. Proof systems for cause based equivalences, full paper, 1993.Google Scholar
  16. 16.
    R. Milner. Communication and Concurrency. Prentice-Hall, 1989.Google Scholar
  17. 17.
    F. Moller. Axioms for Concurrency. Ph.d. thesis, University of Edinburgh, 1989.Google Scholar
  18. 18.
    U. Montanari and D. Yankelevich. A parametric approach to localities. In W. Kuich, editor, Proceedings of ICALP 92, number 623 in Lecture Notes in Computer Science, pages 617–628. Springer-Verlag, 1992.Google Scholar
  19. 19.
    R.J. van Glabbeek and F.W. Vaandrager. Petri net models for algebraic theories of concurrency. In J.W. de Bakker, A.J. Nijman, and P.C. Treleaven, editors, Prooceedings PARLE conference, number 259 in Lecture Notes in Computer Science, pages 224–242. Springer-Verlag, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Astrid Kiehn
    • 1
  1. 1.Technische Universität MünchenMünchen 2

Personalised recommendations