Preview
Unable to display preview. Download preview PDF.
References
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.
J. Camilleri. Introducing a priority operator to ccs. Technical report, Computer Laboratory, University of Cambridge, Cambridge, England, May 1989.
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.
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.
K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. In Proceedings of 16th Annual ACM Symposium on Principles of Programming Languages, 1989.
R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267–310, 1983.
R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.
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.
G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights 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