Abstract
Interworkings is a graphical language for displaying the interaction between system components. In this paper we give a formal semantics for Interworkings based on process algebra. A notion of refinement on Interworkings will be defined.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.C.M. Baeten and J.A. Bergstra. Global Renaming Operators in Concrete Process Algebra. Information and Computation, 78(3):205–245, 1988.
J.C.M. Baeten and C. Verhoef. Concrete Process Algebra. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume IV: Semantic Modelling, pages 149–268. Oxford University Press, 1995.
J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, Cambridge, 1990.
J.A. Bergstra and J.W. Klop. Process Algebra for Synchronous Communication. Information & Control, 60(1/3):109–137, 1984.
ITU-TS. ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITU-TS, Geneva, 1994.
ITU-TS. ITU-TS Recommendation Z.120 Annex B: Algebraic semantics of Message Sequence Charts. ITU-TS, Geneva, 1995.
S. Mauw and M.A. Reniers. An Algebraic Semantics of Basic Message Sequence Charts. The Computer Journal, 37(4):269–277, 1994.
S. Mauw and M.A. Reniers. Empty Interworkings and Refinement — Semantics of Interworkings Revised. Computing science report 95-12, Department of Computing Science, Eindhoven University of Technology, 1995.
S. Mauw, M. van Wijk, and T. Winter. A Formal Semantics of Synchronous Interworkings. In O. FÆrgemand and A. Sarma, editors, SDL'93 Using Objects, Proc. Sixth SDL Forum, pages 167–178, Darmstadt, 1993. Elsevier, Amsterdam.
S. Mauw and T. Winter. A Prototype Toolset for Interworkings. Philips Telecommunication Review, 51(3):41–45, 1993.
A. Rensink and H. Wehrheim. Weak Sequential Composition in Process Algebras. In B. Jonsson and J. Parrow, editors, CONCUR'94: Concurrency Theory, volume 836 of Lecture Notes in Computer Science, pages 226–241. Springer-Verlag, 1994.
C. Verhoef. A General Conservative Extension Theorem in Process Algebra. In E.-R. Olderog, editor, Programming Concepts, Methods and Calculi (PROCOMET '94), volume 56 of IFIP Transactions A, pages 149–168. North-Holland, 1994.
J.L.M. Vrancken. Studies in Process Algebra, Algebraic Specifications and Parallelism. PhD thesis, University of Amsterdam, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mauw, S., Reniers, M.A. (1996). Refinement in Interworkings. In: Montanari, U., Sassone, V. (eds) CONCUR '96: Concurrency Theory. CONCUR 1996. Lecture Notes in Computer Science, vol 1119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61604-7_83
Download citation
DOI: https://doi.org/10.1007/3-540-61604-7_83
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61604-7
Online ISBN: 978-3-540-70625-0
eBook Packages: Springer Book Archive