Skip to main content

Adding action refinement to a finite process algebra

  • Concurrency (BRA Session) (Session 12)
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 510))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4 References

  1. L. Aceto, Action Refinement in Process Algebras, Ph. D. Thesis, University of Sussex, 1990

    Google Scholar 

  2. L. Aceto and M. Hennessy, Termination, Deadlock and Divergence, to appear in the Journal of the ACM. Extended abstract in Proceedings of the 5th Worshop on Mathematical Foundations of Programming Semantics 1989, LNCS 442, pp. 301–318, Springer-Verlag, 1990.

    Google Scholar 

  3. L. Aceto and M. Hennessy, Towards Action-refinement in Process Algebras, Proc. 4th LICS, pp. 138–145, IEEE Computer Society Press, 1989. To appear in Information and Computation.

    Google Scholar 

  4. L. Aceto and M. Hennessy, Adding Action Refinement to a Finite Process Algebra, Computer Science Report 6/90, University of Sussex, 1990

    Google Scholar 

  5. J. C. M. Baeten and R. J. van Glabbeek, Merge and Termination in Process Algebra, Proceedings 7th Conference on Foundations of Software Technology and T.C.S. (K.V. Nori ed.), LNCS 287, pp. 153–172, Springer Verlag, 1987

    Google Scholar 

  6. J. A. Bergstra and J. W. Klop, Algebra of Communicating Processes with Abstraction, TCS 37,1, pp. 77–121, 1985

    Google Scholar 

  7. J. C. M. Baeten and F. Vaandrager, An Algebra for Process Creation, Report CS-R8907, CWI, Amsterdam, 1989

    Google Scholar 

  8. R. van Glabbeek, The Refinement Theorem for ST-bisimulation, to appear in Proc. IFIP Working Group, Sea of Galilee, 1990

    Google Scholar 

  9. R. van Glabbeek, Comparative Concurrency Semantics and Refinement of Actions, Ph. D. Thesis, Free University of Amsterdam, 1990

    Google Scholar 

  10. R. van Glabbeek and F. Vaandrager, Petri Net Models for Algebraic Theories of Concurrency, in Proc. PARLE Conference 1987 (J. de Bakker et al. eds.), LNCS 259, Springer Verlag, 1987

    Google Scholar 

  11. R. van Glabbeek and F. Vaandrager, The Difference between Splitting in n and n + 1, extended abstract of a talk delivered at the Third Workshop on Concurrency and Compositionality, Goslar (Germany), March 1991

    Google Scholar 

  12. M. Hennessy, Axiomatising Finite Concurrent Processes, SIAM Journal on Computing, October 1988

    Google Scholar 

  13. C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall, 1985

    Google Scholar 

  14. R. Milner, Communication and Concurrency, Prentice-Hall, 1989

    Google Scholar 

  15. A. Stoughton, Substitution Revisited, TCS 59, pp. 317–325, 1988

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Javier Leach Albert Burkhard Monien Mario Rodríguez Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aceto, L., Hennessy, M. (1991). Adding action refinement to a finite process algebra. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_159

Download citation

  • DOI: https://doi.org/10.1007/3-540-54233-7_159

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54233-9

  • Online ISBN: 978-3-540-47516-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics