Skip to main content
SpringerLink
Log in

Priority as extremal probability

  • Selected Presentations
  • Conference paper
  • First Online:
CONCUR '90 Theories of Concurrency: Unification and Extension (CONCUR 1990)

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

Included in the following conference series:

Research supported by NSF Grant CCR-8704309.

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. C. M. Baeten, J. A. Bergstra, and J. W. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Fundamenta Informaticae IX, pages 127–168, 1986.

    Google Scholar 

  2. J. Camilleri. Introducing a priority operator to ccs. Technical report, Computer Laboratory, University of Cambridge, Cambridge, England, May 1989.

    Google Scholar 

  3. R. Cleveland and M. Hennessy. Priorities in process algebras. In Proceedings of 3rd Annual IEEE Symposium on Logic in Computer Science, pages 193–202, Edinburgh, Scotland, July 1988.

    Google Scholar 

  4. A. Giacalone, C.-C. Jou, and S. A. Smolka. Algebraic reasoning for probabilistic concurrent systems. In Proceedings of Working Conference on Programming Concepts and Methods, Sea of Gallilee, Israel, April 1990. IFIP TC 2.

    Google Scholar 

  5. K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. In Proceedings of 16th Annual ACM Symposium on Principles of Programming Languages, 1989.

    Google Scholar 

  6. R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267–310, 1983.

    Google Scholar 

  7. R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.

    Google Scholar 

  8. D. M. R. Park. Concurrency and automata on infinite sequences. In Proceedings of 5th G.I. Conference on Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science, pages 167–183. Springer-Verlag, 1981.

    Google Scholar 

  9. G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.

    Google Scholar 

  10. A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. In Proceedings of 12th ICALP, Lecture Notes in Computer Science, pages 15–32. Springer Verlag, 1985.

    Google Scholar 

  11. R. van Glabbeek, S. A. Smolka, B. Steffen, and C. M. N. Tofts. Reactive, generative, and stratified models of probabilistic processes. In Proceedings of 5th Annual IEEE Symposium on Logic in Computer Science, pages 130–141, Philadelphia, PA, June 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, SUNY at Stony Brook, 11794-4400, Stony Brook, NY, USA

    Scott A. Smolka

  2. Datalogisk Afdeling, Aarhus University, Ny Munkegade 116, 8000, Aarhus C, Denmark

    Bernhard Steffen

Authors
  1. Scott A. Smolka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernhard Steffen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. C. M. Baeten J. W. Klop

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Smolka, S.A., Steffen, B. (1990). Priority as extremal probability. In: Baeten, J.C.M., Klop, J.W. (eds) CONCUR '90 Theories of Concurrency: Unification and Extension. CONCUR 1990. Lecture Notes in Computer Science, vol 458. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039077

Download citation

  • DOI: https://doi.org/10.1007/BFb0039077

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53048-0

  • Online ISBN: 978-3-540-46395-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation