Preview
Unable to display preview. Download preview PDF.
References
M. Ben-Ari, A. Pnueli, and Z. Manna. The temporal logic of branching time. Acta Informatica, 20, 1983.
J.C. Godskesen, A. Ingolfsdottir, and M. Zeeberg. Fra Hennessy-Milner Logik til CCS-processer. PhD thesis, Aalborg University Center, Denmark, 1987.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computing Machinery, pages 137–161, 1985.
S. Holmström. Reasoning about CCS agents using Hennessy-Milner logic extended with fixed points. BCS—FACS Workshop on Specification and Verification of Concurrent Systems, 1987.
D. Kozen. Results on the propositional mu-calculus. Lecture Notes in Computer Science, 140, 1982. in Proc. of ICALP'82.
K.G. Larsen. Context-Dependent Bisimulation Between Processes. PhD thesis, University of Edinburgh, Mayfield Road, Edinburgh, Scotland, 1986.
K.G. Larsen. Proof systems for Hennessy-Milner logic with recursion. Lecture Notes in Computer Science, 299, 1988. in Proc. of CAAP'88. Full version to appear in Theoretical Computer Science.
K.G. Larsen and R. Milner. Verifying a protocol using relativized bisimulation. Lecture Notes in Computer Science, 267, 1987. in Proc. of ICALP'87.
K.G. Larsen and L. Xinxin. Compositionality through an operational semantics of contexts. Technical Report R 89-13, Aalborg University, Department of Mathematics and Computer Science, 1989.
R. Milner. Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer Verlag, 1980.
R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25, 1983.
D. Park. Concurrency and automata on infinite sequences. Lecture Notes in Computer Science, 104, 1981. in Proc. of 5th GI Conf.
G. Plotkin. A structural approach to operational semantics. FN 19, DAIMI, Aarhus University, Denmark, 1981.
A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. Lecture Notes in Computer Science, 194, 1985. in Proc. of ICALP'87.
C. Stirling. A compositional modal proof system for a subset of ccs. Lecture Notes in Computer Science, 194, 1986.
C. Stirling and D. Walker. Local model checking in the modal mu-calculus. Lecture Notes in Computer Science, 352, 1989. In Proc. of Tapsoft'89.
G. Winskel. On the composition and decomposition of assertions. Lecture Notes in Computer Science, 197, 1984.
G. Winskel. Model checking the modal nu-calculus. Lecture Notes in Computer Science, 372, 1989. In Proc. of ICALP'89.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Larsen, K.G., Xinxin, L. (1990). Compositionality through an operational semantics of contexts. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032056
Download citation
DOI: https://doi.org/10.1007/BFb0032056
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52826-5
Online ISBN: 978-3-540-47159-2
eBook Packages: Springer Book Archive