This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Abramsky, S., Domain theory as a theory of experiments. In this proceedings (1984).
Aczel, P., An introduction to inductive definitions. In the handbook of Mathematical Logic, Ed. Barwise, J., North-Holland (1983).
Barringer H., Kuiper R. and Pnueli A., Now you may compose temporal logic specifications. In the proceedings of STOC 84 (1984).
de Nicola, R. and Hennessy, M.C.B., Testing Equivalences for Processes, Lecture Notes in Comp. Sc. vol. 154 (1983). To appear in JACM.
Golson, W. and Rounds W., In this proceedings (1984).
Hoare, C.A.R., A model for communicating sequential processes. Monograph of the Programming Research Group, Oxford University (1981).
Hoare, C.A.R., Brookes, S.D., and Roscoe, A.W., A Theory of Communicating Processes, Technical Report PRG-16, Programming Research Group, University of Oxford (1981); appears also in JACM (1984).
Hennessy, M.C.B. and Milner, R., On observing nondeterminism and concurrency, Springer LNCS Vol. 85. (1979).
Hennessy, M.C.B. and Plotkin, G. D., A term model for CBL. Springer LNCS Vol. 88. (1980).
Larsen, K. and Winskel, G., Using Information Systems to solve Recursive Domain Equations Effectively. Springer Lecture Notes in Comp. Sc., vol. 173 (1984).
Milner, R., A Calculus of Communicating Systems. Springer Lecture Notes in Comp. Sc. vol. 92 (1980).
Milner, R., A modal characterisation of observable machine-behaviour. Springer Lecture Notes in Comp. Sc. vol. 112 (1981).
Milner, R., Calculi for synchrony and asynchrony, Theoretical Computer Science, pp.267–310 (1983).
Olderog, E-R. and Hoare, C.A.R., Specification-oriented semantics for communicating processes. Monograph of the Programming Research Group, Oxford University (1984).
Plotkin, G. D., Some comments on Robin's “A modal characterisation of observable machine-behaviour”. Handwritten notes, Comp. Sc. Dept., University of Edinburgh (1983).
Scott, D. S., Domains for Denotational Semantics. ICALP 1982.
Scott, D. S., Lectures on a mathematical theory of computation. Oxford University Computing Laboratory Technical Monograph PRG-19 (1981).
Smyth, M.B., Power domains and predicate transformers: a topological view. Proc. of ICALP 83, Springer Lecture Notes in Comp. Sc. vol. 154 (1983).
Stirling, C., A complete modal proof system for a subset of SCCS. Research report, Dept. of Comp. Sci., Edinburgh University (1984).
Stirling, C., A proof theoretic characterisation of observational equivalence. Research report, Dept. of Comp. Sci., Edinburgh University, CSR-132-83 (1983). A version also appears in the proceedings of the Bangalore conference, India (1983) and is to appear in Theoretical Computer Science.
Winskel, G., Synchronisation trees. Technical Report, Comp. Sc. Dept., Carnegie-Mellon University (1983). To appear in Theoretical Computer Science.
Winskel, G., A complete proof system for SCCS with modal assertions. In preparation.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag
About this paper
Cite this paper
Winskel, G. (1985). On the composition and decomposition of assertions. In: Brookes, S.D., Roscoe, A.W., Winskel, G. (eds) Seminar on Concurrency. CONCURRENCY 1984. Lecture Notes in Computer Science, vol 197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15670-4_3
Download citation
DOI: https://doi.org/10.1007/3-540-15670-4_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15670-3
Online ISBN: 978-3-540-39593-5
eBook Packages: Springer Book Archive