Priority as extremal probability

Formal Aspects of Computing

Volumn 8, Issue 5, 1996, Pages 585-606

  Smolka, Scott A ^a   Steffen, Bernhard ^b  

^a Stony Brook University   (United States)

^b UNIVERSITY OF PASSAU   (Germany)

Author keywords

Priority; Probabilistic bisimulation; Probability; Synchronous process calculus

Indexed keywords

EID: 0345748539     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01211910     Document Type: Article

References (25)

1. Barrett, G.: The semantics of priority and fairness in occam. In Mathematical Foundations of Programming Semantics, pages 194-208. Volume 442 of Lecture Notes in Computer Science, Springer-Verlag, 1989.
2. Baeten, J. C. M., Bergstra, J. A. and Klop, J. W.: Syntax and defining equations for an interrupt mechanism in process algebra. Fundamenta Informaticae IX, pages 127-168, 1986.
3. Best, E. and Koutny, M.: Petri net semantics of priority systems. Theoretical Computer Science, 96(1):175-215, 1992.
4. Camilleri, J. A.: Priority in process calculi. Technical Report No. 227, Computer Laboratory. Univesity of Cambridge, Ph.D. Thesis, Cambridge, England, June 1991.
5. th Annual ACM Symposium, on Principles of Programming Languages, pages 238-252, Los Angeles, CA, 1977.
6. Cleaveland, R. J. and Hennessy, M. C. B.: Priorities in process algebras. Information and Computation, 87(1/2):58-77, 1990.
7. Cleaveland, R., Lüttgen, G. and Natarajan, V.: A process algebra with distributed priorities. In Proceedings of CONCUR '96 - Seventh International Conference on Concurrency Theory. Lecture Notes in Computer Science, Springer-Verlag, 1996.
8. Camillen, J. A. and Winskel, G.: CCS with priority choice. In Proceedings of the 6th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, July 1991.
9. Fidge, C. J.: A formal definition of priority in CSP. ACM Transactions on Programming Languages and Systems, 15(4):681-705, September 1993.
10. German, S. M.: Programming in a general model of synchronization. In Proceedings of CONCUR '92 - Third International Conference on Concurrency Theory, pages 534-549. Volume 630 of Lecture Notes in Computer Science, Springer-Verlag, 1992.
11. Giacalone, A., Jou, C.-C. and Smolka, S. A.: 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, North-Holland.
12. Gerber, R. and Lee, I.: A Resource-Based Prioritized Bisimulation for Real-Time Systems. Information and Computation, 113(1):102-142, August 1994.
13. Hansson, H. A.: Time and Probability in Formal Design of Distributed Systems, volume 1 of Real - Time Safety Critical Systems. H. Zedan, editor, Elsevier, Amsterdam, 1994.
14. Hansson, H. A. and Orava, F.: A process algebra with incomparable priorities. In S. Purushothaman and A. Zwarico, editor. First North American Process Algebra Workshop, Workshops in Computing, pages 216-230, Port Jefferson, USA, 1992. Springer-Verlag. ISBN 3-540-19822-9.
15. Larsen, K. G. and Skou, A.: Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, September 1992.
16. Milner, R.: A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1980.
17. Milner, R.: Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267-310, 1983.
18. Milner, R.: Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.
19. Natarajan, V., Christoff, L., Christoff, I. and Cleaveland, R.: Priorities and abstraction in process algebra. In P. S. Thiagarajan, editor. Proceedings of Foundations of Software Technology and Theoretical Computer Science, pages 217-230. Volume 880 of Lecture Notes in Computer Science, Springer-Verlag, 1994.
20. Park, D. M. R.: Concurrency and automata on infinite sequences. In Proceedings of 5th G.I. Conference on Theoretical Computer Science, pages 167-183. Volume 104 of Lecture Notes in Computer Science, Springer-Verlag, 1981.
21. Plotkin, G. D.: A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
22. Pnueli, A.: Applications of temporal logic to the specification and verification of re-active systems: A survey of current trends. In J. de Bakker, W.-P. de Roever, and G. Rozenberg, editors. Current Trends in Concurrency. Volume 224 of Lecture Notes in Computer Science, Springer-Verlag, 1986.
23. Shaplej, L.S.: Stochastic games. Proc. Nat. Acad. Sci. U.S.A., 39:1095-1100, 1953.
24. Tofts, C. M. N.: A synchronous calculus of relative frequency. In J. C. M. Baeten and J. W. Klop, editors, Proceedings of CONCUR '90, volume 458, pages 467-480. Volume 458 of Lecture Notes in Computer Science, Springer-Verlag, 1990.
25. van Glabbeek, R. J., Smolka, S. A and Steffen, B.: Reactive, generative, and stratified models of probabilistic processes. Information and Computation, 121(1):59-80, August 1995.