Skip to main content
SpringerLink
Log in

Processes with probabilities, priority and time

  • Published:
Formal Aspects of Computing

Abstract

A probabilistic calculus, derived from Milner's SCCS, WSCCS is presented. We define a notion of bisimulation for probabilistic processes and show that it is a congruence. A simple equational characterisation is shown to be both sound and complete for finite processes. We present many examples including some extended ones. The larger examples show both the expressive power of WSCCS and the availability of simple proof methods for some complex systems.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Baeten, J., Bergstra J. and Klop J.: Syntax and defining equations for an interrupt mechanism in process algebra,Fundamenta Informatica IX, pp 127–168, 1986.

    Google Scholar 

  2. Chen, L., Anderson S. and Moller F.: A Timed Calculus of Communicating Systems, Research Report, Dept. Of Computer Science, Edinburgh University, LFCS-127, 1990

  3. Cammilleri. J.: Introducing a Priority Operator to CCS, Computer Laboratory Technical Report, Cambridge University, 1989.

  4. Christoff, I.: Testing Equivalences and Fully Abstract Models for Probabilistic Processes,in Proceedings Concur '90, LNCS 458, 1990.

  5. Grimmet, G.R. and Stirzaker D.R.,Probability and Random Processes, Oxford Science Publications, 1982.

  6. van Glabbek, R., Smolka S. A., Steffen B. and Tofts C.: Reactive, Generative and Stratified Models of Probabilistic Processes,in proceedings LICS 1990, 1990.

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

  8. Hennessey M. and Regan T.: A Temporal Process Algebra, Technical Report, Department of Cognitive Science, Sussex University, 1990.

  9. Hatcher, M., Tofts C. and Franks N.: Mutual Exclusion as a Mechanism for Information Exchange in Ant Nests,in Proceedings of the First European Conference on Social Insects, 1991.

  10. Jones, C.C.M.:Probabilistic Non-determinism, PhD Thesis University of Edinburgh, 1990.

  11. Keilson, J.:Markov Chain Models — Rarity and exponentiality, Applied Mathematical Sciences 28, Springer Verlag.

  12. Jou, C. and Smolka S.: Equivalences, Congruences and Complete Axiomatizations for Probabilistic Processes,in Proceedings Concur '90, LNCS 458, 1990.

  13. Larsen, K.G. and Skou A.: Bisimulation through probabilistic testing,in proceedings POPL 1989, 1989.

  14. Milner, R.: Calculi for Synchrony and Asynchrony,Theoretical Computer Science 25(3), pp 267–310, 1983.

    Google Scholar 

  15. Milner, R.:Communication and Concurrency, Prentice Hall, 1990.

  16. Moller, F., and Tofts C.: A Temporal Calculus of Communicating Systems,in proceedings Concur '90, LNCS 458, 1990.

  17. Plotkin, G.D.: A structured approach to operational semantics. Technical report Daimi Fn-19, Computer Science Department, Aarhus University. 1981.

  18. Reed, G., and Roscoe W.: A Timed Model for CSP,inProceedings ICALP '86, LNCS 226, 1986.

  19. Smolka, S., and Steffen B.: Priority as Extremal Probability,in proceedings Concur '90, LNCS 458, 1990.

  20. Smolka, S., Steffen B. and Tofts C.: unpublished notes. Working title, Probability + Restriction ⇒ priority.

  21. Tofts,C., Hatcher M.J., Franks N.: Autosynchronisation in Leptothorax Acervorum; Theory, Testability and Experiment,Journal of Theoretical Biology 157: 71–82.

  22. Tofts, C., and Franks N.: Doing the Right Thing: Ants, Bees and Naked Mole Rats,Trends in Evolution and Ecology 7: 346–349.

  23. Tofts, C.: Timing Concurrent Processes, LFCS-report. number 103, 1989.

  24. Tofts, C.: A Synchronous Calculus of Relative Frequency,in proceedings CONCUR '90, Springer Verlag, LNCS 458, 1990

  25. Tofts, C.: The Autosynchronisation ofLeptothorax Acervorum (Fabricius) Described in WSCCS, LFCS-Report Number 128.

  26. Tofts, C.: Task Allocation in Monomorphic Ant Species, LFCS-Report Number 128.

  27. Tofts, C.: Using Process Algebra to Descirbe Social Insect Behaviour,Transactions of the Society for Computer Simulation, 1993.

  28. Yi W.: Real-Time Behaviour of Asynchronous Agents,in proceedings Concur '90, LNCS 458, pp 502–520, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University College Swansea, Swansea, UK

    Chris Tofts

Authors
  1. Chris Tofts
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chris Tofts.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tofts, C. Processes with probabilities, priority and time. Formal Aspects of Computing 6, 536–564 (1994). https://doi.org/10.1007/BF01211867

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Search

Navigation