Abstract
We provide a systematic reconstruction of Abramsky’s category SProc of synchronous processes [Abr93]: SProc is isomorphic to a span category on a category of traces. The significance of the work is twofold: It shows that the original presentation of SProc in mixed formulations is unnecessary — a simple categorical description exists. Furthermore, the techniques employed in the reconstruction suggest a general method of obtaining process categories with structure similar to SProc. In particular, the method of obtaining bisimulation equivalence in our setting, which represents an extension of the work of Joyal, Nielsen and Winskel [JNW93], has natural application in many settings.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abramsky, S., Interaction Categories (Extended Abstract). Theory and Formal Methods Workshop, Springer Verlag, 1993.
Abramsky, S., S. Gay and R. Nagarajan, Constructing and verifying typed processes. Available by FTP, 1993.
Abramsky, S., and R. Jagadeesan. Games and Full Completeness for Multiplicative Linear Logic. Imperial College Technical Report DoC 92 /24, 1992.
Abramsky, S., Jagadeesan, R., and Malacaria, P. Games and full abstraction for PCF: preliminary annnouncement. Unpublished.
Aczel, P., Non-well-founded sets. CLSI Lecture Notes 14, Center for the Study of Language and Information, 1988.
Carboni, A., S. Lack and R.F.C. Walters, Introduction to extensive and distributive categories. Manuscript, March 1992.
Carboni, A. and R.F.C. Walters, Cartesian bicategories I. Journal of Pure and Applied Algebra, 49: 11–32, 1987.
Cockett, J.R.B., List-arithmetic open categories: Locoi. Journal of Pure and Applied Algebra, 66: 1–29, 1990.
Cockett, J.R.B., Introduction to distributive categories. Mathematical Structures in Computer Science, 3: 277–307, 1993.
Cockett J.R.B. and D. Spooner, The category of Protocols. Presented at Dägstuhl, 1993.
Joyal, A., M. Nielsen and G. Winskel, Bísimulation and open maps. Proceedings of the Eighth Symposium on Logic in Computer Science, IEEE, 1993.
Milner, R., Calculi for synchrony and asynchrony. Theoretical Computer Science, 25: 267–310, 1983.
Power, A.J. and C.Wells, A formalism for the specification of essentially algebraic structures in 2-categories. Mathematical Structures in Computer Science, 2: 1–28, 1992.
Winskel, G., A Compositional Proof System on a Category of Labelled Transition Systems. Information and Computation 87: 2–57.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cockett, J.R.B., Spooner, D.A. (1994). SProc Categorically. In: Jonsson, B., Parrow, J. (eds) CONCUR ’94: Concurrency Theory. CONCUR 1994. Lecture Notes in Computer Science, vol 836. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48654-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-48654-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58329-5
Online ISBN: 978-3-540-48654-1
eBook Packages: Springer Book Archive