Abstract
In this paper we extend CCS transitions, labelled by strings, to concurrent histories, i.e. to transitions labelled by partial orderings. The two notions are linked by a theorem which shows that the strings can be obtained by taking all interleavings compatible with the partial orderings.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Brookes, S.D., Hoare, C.A.R., and Roscoe, A.W. A Theory of Communicating Sequential Processes, J. ACM 31, 3 (1984), 560–599.
Castellani, I., Franceschi, P., and Montanari, U. Labeled Event Structures: A Model for Observable Concurrency, Proc. IFIP TC 2 — Working Conference: Formal Description of Programming Concepts II (D. Bjørner Ed.), Garmisch — Partenkirchen, 1982, North-Holland, Amsterdam, 1983, pp. 383–400.
Darondeau, Ph., and Kott, L. On the Observational Semantics of Fair Parallelism, Proc. 10th ICALP (J. Diaz Ed.), LNCS, 154, Springer-Verlag, Berlin, 1983, pp. 147–151.
Degano,P., and Montanari,U. Liveness Properties as Convergence in Metric Spaces, Proc. 16th Annual ACM SIGACT Symposium on Theory of Computing, April 30–May 2, 1984, Washington, DC, pp. 31–38.
Degano, P., and Montanari, U. Distributed Systems, Partial Orderings of Events, and Event Structures, Lecture Notes of the 1984 International Summer School on Control Flow and Data Flow — Concepts of Distributed Programming (M. Broy Ed.), Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1984.
De Nicola, R., and Hennessy, M.C.B. Testing Equivalence for Processes, TCS 34 (1984), 83–133.
Goltz, U., and Reisig, W. The Non-Sequential Behaviour of Petri Nets, Info. and Co., 57, (1983), 125–147.
Lamport, L. Time, Clocks and the Ordering of Events in a Distributed System, C.ACM 12 (1978), 558–564.
Lauer, P.E., Torrigiani, P., Shields, M.W. COSY: A Specification Language based on Path Expressions, Acta Informatica, 12 (1979), 109–158.
Mazurkiewicz,A. Concurrent program schema and their interpretation, Proc. Aarhus Workshop on Verification of Parallel Programs, 1977.
Milner, R. A Calculus of Communicating Systems, LNCS, 92, Springer-Verlag, Berlin, 1980.
Nivat,M. Behaviours of Processes and Synchronized Systems of Processes, In: Theoretical Foundations of Programming Methodology (M. Broy and G. Schmidt Eds), Reidel Dodrecht, 1982, pp. 473–550.
Petri, C.A. Concurrency, Proc. Net Theory and Applications, LNCS, 84, Springer-Verlag, Berlin, 1980, pp. 251–260.
Plotkin, G.D. An Operational Semantics for CSP, Proc. IFIP TC 2-Working Conference: Formal Description of Programming Concepts II (D. Bjørner Ed.), Garmisch-Partenkirchen, June 1982, North-Holland, Amsterdam 1983, pp. 199–223.
Pratt, V.R. On the Composition of Processes, Proc. 9th POPL, Albuquerque, New Mexico, 1982.
Schields,M.W. Non-Sequential Behaviour I, Internal Report CSR-120-82, Dept. of Computer Science, University of Edinburgh (1982).
Winkowski, J. Behaviours of Concurrent Systems, TCS 12 (1980), 39–60.
Winskel, G. Event Structure Semantics for CCS and Related Languages, Proc. 9th ICALP (M. Nielsen and E.M. Schmidt Eds), LNCS, 140, Springer-Verlag, Berlin 1982, pp. 561–576.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Degano, P., De Nicola, R., Montanari, U. (1985). Partial ordering derivations for CCS. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028836
Download citation
DOI: https://doi.org/10.1007/BFb0028836
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15689-5
Online ISBN: 978-3-540-39636-9
eBook Packages: Springer Book Archive