Abstract
This paper presents a meta-model of observation in concurrency theory; it allows us to unify notions of observation in many different behavioural settings. We treat traces, process trees and event structures, and show how observations of them fit into a common framework. Behaviour and observation will both be modeled as categories and lined using the notions of ‘functor’ and ‘adjunction’.
Timing will be our chief example of observation; we present a timed traces model, and hint how it generalises to timed process trees (branching time) and timed ‘true concurrency.’ The general setup sees timing as a way of embedding observations into time; we propose stable categories of embeddings as natural metamodels of timed observation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
S. Abramsky and S. Vickers, Quantales, observationallogic and process semantics, Technical Report DOC 90/1, Department of Computing, Imperial College, 1991.
J. van Benthem, The logic of time, D. Reidel, 1983.
S. Brookes and A. Roscoe, An improved failures model for communicating sequential processes, in the Proceedings NSF-SERC Seminar on Concurrency, Volume 197, Springer-Verlag LNCS, 1985.
T. Coquand, Categories of embeddings, Theoretical Computer Science, Volume 68 (1989), Pp. 221–237.
T. Coquand, C. Gunter, and G. Winskel, dI-domains as a model of polymorphism, in Mathematical Foundations of Programming Language Semantics, Volume 298, Springer-Verlag LNCS, 1988.
J. Davies and S. Schneider, An introduction to timed CSP, Technical Report Number 75, Oxford University Computer Laboratory, 1989.
U. Engberg and G. Winskel, Petri nets as models of linear logic, in the Proceedings of TAPSOFT (CAAP) (A. Arnold, Ed.), Volume 431, Springer-Verlag LNCS, 1990.
C. Hoare, Communicating sequential processes, International series on computer science, Prentice-Hall, 1985.
A. Jeffrey, Timed process algebra ≠ time × process algebra, Technical Report 79, Programming Methodology Group, Chalmers University, 1991.
J. Meseguer and U. Montanari, Petri nets are monoids: A new algebraic foundation for net theory, in Logic in Computer Science, (1988), 1988, Proceedings of the 3rd Annual IEEE Symposium, pp. 155–164.
D. Murphy, Time, causality, and concurrency, Ph.D. thesis, Department of Mathematics, University of Surrey, 1989, available as Technical Report CSC 90/R32, Department of Computing Science, University of Glasgow.
D. Murphy and A. Poigné, A functorial semantics for observed concurrency, Technical Report to appear, GMD, 1992.
A. Pnueli, Linear and branching structures in the semantics and logics of reactive systems, in Automata, Languages and Programming (W. Brauer, Ed.), Volume 194, Springer-Verlag LNCS, 1986, (12th Coll.).
S. Vickers, Topology via logic, Tracts in Theoretical Computer Science, Volume 5, Cambridge University Press, 1989.
G. Whitrow, The natural philosophy of time, Oxford University Press, 1980.
G. Winskel, Event structures, in Petri Nets: Central Models and Their Properties (W. Brauer, W. Reisig, and G. Rozenberg, Eds.), Volume 254, Springer-Verlag LNCS, 1986, Proceedings of Advances in Petri Nets. Also available as a Cambridge University Computer Laboratory Technical Report.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Murphy, D., Poigné, A. (1992). A functorial semantics for observed concurrency. In: Havel, I.M., Koubek, V. (eds) Mathematical Foundations of Computer Science 1992. MFCS 1992. Lecture Notes in Computer Science, vol 629. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-55808-X_39
Download citation
DOI: https://doi.org/10.1007/3-540-55808-X_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55808-8
Online ISBN: 978-3-540-47291-9
eBook Packages: Springer Book Archive