Abstract
We present a weighted synchronous calculus that can be interpreted as reasoning over probabilistic processes [LS89,SST89,GSST90]. The abstraction from absolute weight to relative frequency is obtained semantically. We also add a notion of dominance which can be interpreted as priority. This notion is shown to be dual to that of “zero probability” [SST89,GSST90] and can be used to construct arbitrary priority structures. Finally, an equational system for reasoning about the weighted processes is presented.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
8 Bibliography
J. Baeten, J. Bergstra and J. Klop, Syntax and defining equations for an interrupt mechanism in process algebra, Fundamenta Informatica IX, pp 127–168, 1986
R. Cleveland and M. Hennessey, Priorites in Process Algebras, proceedings LICS 1988.
A. Giaclone, C.-C. Jou, and S. A. Smolka, Algebraic reasoning for probabilistic concurrent systems, proceedings of working conference on programming concepts and methods IFIP TC 2, 1990.
R. van Glabbek, S. A. Smolka, B. Steffen and C. Tofts, Reactive, Generative and Stratified Models of Probabilistic Processes, proceedings LICS 1990.
C. Jones and G. D. Plotkin, A probabilistic powerdomain of evaluations, proceedings LICS 1989.
J. Keilson, Markov Chain Models — Rarity and exponentiality, Applied Mathematical Sciences 28, Springer Verlag.
K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. proceedings POPL 1989.
R. Milner, Calculi for Synchrony and Asynchrony, Theoretical Computer Science 25(3), pp 267–310, 1983.
R. Milner, Communication and Concurrency, Prentice Hall, 1989.
F. Moller and C.Tofts, a Temporal Calculus of Communicating Systems, LFCS-89-104, University of Edinburgh.
D. Park, Concurrency and Automata on infinite sequences, Springer LNCS 104.
G. D. Plotkin, A structured approach to operational semantics. Technical report Daimi Fn-19, Computer Science Department, Aarhus University. 1981
M. Rabin, Probabilistic algorithmns, Algorithmns and Complexity, recent results and new directions, J. Traub ed Academic press, New York, 1976 pp 21–39.
S. Smolka, B. Steffen and C. Tofts, unpublished notes. Working title, Probability + Restriction ⇒ priority.
C. Tofts, Timing Concurrent Processes, LFCS-89-103, University of Edinburgh.
C. Tofts, Proof Methods and Pragmatics for Parallel Programming, Thesis in examination.
C. Tofts, Relative Frequency in a Synchronous Calculus, LFCS-90-108, University of Edinburgh.
D. Welsh, Randomised algorithmns, Discrete applied mathematics 5, 1983 pp 133–145.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tofts, C. (1990). A synchronous calculus of relative frequency. 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/BFb0039078
Download citation
DOI: https://doi.org/10.1007/BFb0039078
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