Skip to main content
SpringerLink
Log in

Priority and abstraction in process algebra

  • Concurrency
  • Conference paper
  • First Online:
Foundation of Software Technology and Theoretical Computer Science (FSTTCS 1994)

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

Abstract

This paper defines a behavioral equivalence based on the notion of weak observational equivalence for processes in which actions may take priority over other actions. The largest congruence contained in this relation is then identified and given a complete equational axiomatization for finite processes. An example illustrates the utility of this equivalence which, in contrast with other equivalences for systems with priorities, abstracts from internal computation.

Authors supported by NSF/DARPA grant CCR-9014775, NSF grant CCR-9120995, ONR Young Investigator Award N00014-92-J-1582, and NSF Young Investigator Award CCR-9257963.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Baetan, J. Bergstra, and J. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Technical Report CS-R8503, Department of Computer Science, University of Amsterdam, 1985.

    Google Scholar 

  2. J. Baeten, editor. Applications of Process Algebra, volume 17 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, England, 1990.

    Google Scholar 

  3. J. Baeten and W. Weijland. Process Algebra, volume 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, England, 1990.

    Google Scholar 

  4. R. Bol and J. Groote. The meaning of negative premises in transition system specification. In Proceedings of the International Colloquium on Automata, Languages and Programming, pages 481–494, Madrid, Spain, July 1991. Springer-Verlag.

    Google Scholar 

  5. P. Brémonde-Grégoire, I. Lee, and R. Gerber. ACSR: An algebra of communicating shared resources with dense time and priorities. In CONCUR '93, volume 715 of Lecture Notes in Computer Science, pages 417–431, Hildesheim, Germany, August 1993. Springer-Verlag.

    Google Scholar 

  6. J. Camilleri and G. Winskel. CCS with priority choice. In Proceedings of the Symposium on Logic in Computer Science, pages 246–255, Amsterdam, July 1991. Computer Society Press.

    Google Scholar 

  7. R. Cleaveland. Analyzing concurrent systems using the Concurrency Workbench. In P. Lauer, editor, Functional Programming, Concurrency, Simulation and Automated Reasoning, volume 693 of Lecture Notes in Computer Science, pages 129–144. Springer-Verlag, 1993.

    Google Scholar 

  8. R. Cleaveland and M. Hennessy. Priorities in process algebra. Information and Computation, 87(1/2): 58–77, July/August 1990.

    Google Scholar 

  9. R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A semantics-based tool for the verification of finite-state systems. ACM Transactions on Programming Languages and Systems, 15(1): 36–72, January 1993.

    Google Scholar 

  10. R. Gerber and I. Lee. CCSR: A calculus for communicating shared resources. In CONCUR '90, volume 458 of Lecture Notes in Computer Science, pages 263–277, Amsterdam, August 1990. Springer-Verlag.

    Google Scholar 

  11. H. Hansson and F. Orava. A process calculus with incomparable priorities. In Proceedings of the North American Process Algebra Workshop, 1992.

    Google Scholar 

  12. M. Hennessy. Algebraic Theory of Processes. MIT Press, Boston, 1988.

    Google Scholar 

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

    Google Scholar 

  14. C.-T. Jensen. CCS with priorities. Technical report, Computer Science Department, Aarhus University, 1992.

    Google Scholar 

  15. R. Milner. Communication and Concurrency. Prentice-Hall, London, 1989.

    Google Scholar 

  16. S. Smolka and B. Steffen. Priority as extremal probability. In CONCUR '90, volume 458 of Lecture Notes in Computer Science, pages 456–466, Amsterdam, August 1990. Springer-Verlag.

    Google Scholar 

  17. R. van Glabbeek and P. Weijland. Branching time and abstraction in bisimulation semantics. In Information Processing 89, pages 613–618. North-Holland, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, North Carolina State University, 27695-8206, Raleigh, NC, USA

    V. Natarajan & R. Cleaveland

  2. Department of Computer Systems, Uppsala University, Uppsala, Sweden

    I. Christoff & L. Christoff

Authors
  1. V. Natarajan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Christoff
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. L. Christoff
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. R. Cleaveland
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. S. Thiagarajan

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Natarajan, V., Christoff, I., Christoff, L., Cleaveland, R. (1994). Priority and abstraction in process algebra. In: Thiagarajan, P.S. (eds) Foundation of Software Technology and Theoretical Computer Science. FSTTCS 1994. Lecture Notes in Computer Science, vol 880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58715-2_127

Download citation

  • DOI: https://doi.org/10.1007/3-540-58715-2_127

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58715-6

  • Online ISBN: 978-3-540-49054-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation