International Journal of Parallel Programming

, Volume 16, Issue 6, pp 451–478 | Cite as

Partial ordering models for concurrency can be defined operationally

  • Pierpaolo Degano
  • Sergio Marchetti
Article

Abstract

Labelled rewriting systems are shown to be powerful enough for defining the semantics of concurrent systems in terms of partial orderings of events, even in the presence of non standard operators like N that is not expressible by means of concurrency and sequentialization. This contrasts with Pratt's claim.(1) The main operators proposed by Pratt are used here to construct terms denoting concurrent systems, the behavior of which consists of partially ordered multisets defined operationally.(2) Fully abstractness of the denotational semantics as defined in Ref. 1 with respect to the operational one is finally proved.

Key Words

Concurrency partial orderings pomsets labelled rewriting systems operational semantics denotational semantics fully abstractness 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    V. Pratt, Modelling Concurrency with Partial Orders,International Journal of Parallel Programming,15:33–71 (1986).Google Scholar
  2. 2.
    P. Degano, R. De Nicola, and U. Montanari, A Partial Ordering Semantics for CCS. Dipartimento di Informatica Research Rep TR-3/88.Google Scholar
  3. 3.
    D. Austry and G. Boudol, Algèbre de Processus et Synchronization,Theoret. Comput. Sci.,30(1):91–131 (1984).Google Scholar
  4. 4.
    J. A. Bergstra and J.-W. Klop, Process Algebra for Synchronous Communication,Info. and Co.,61:109–137 (1984).Google Scholar
  5. 5.
    S. D. Brookes, C. A. R. Hoare, and A. D. Roscoe, A Theory of Communicating Sequential Processes,Journal of ACM,31 (3):560–599 (1984).Google Scholar
  6. 6.
    M. Hennessy,An Algebraic Theory of Processes, MIT Press (to appear).Google Scholar
  7. 7.
    L. Lamport, What Good is Temporal Logic?Proc. IFIP'83, North-Holland, Amsterdam, pp. 657–668 (1983).Google Scholar
  8. 8.
    G. Milne, CIRCAL and the Representation of Communication, Concurrency and Time,ACM TOPLAS,7(2):270–298 (1985).Google Scholar
  9. 9.
    R. Milner,A Calculus of Communicating Systems, Lecture Notes in Computer Science, Vol. 92, Springer-Verlag, Heidelberg (1980).Google Scholar
  10. 10.
    M. Nivat, Behaviours of Processes and Synchronized Systems of Processes, in:Theoretical Foundations of Programming Methodology M. Broy and G. Schmidt (eds.), Reidel, Dodrecht, pp. 473–550 (1982).Google Scholar
  11. 11.
    G. Plotkin, A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, Aarhus University, Department of Computer Science, Aarhus, (1981).Google Scholar
  12. 12.
    G. Boudol and I. Castellani, On the Semantics of Concurrency, Partial Orders and Transition Systems inProc. Tapsoft-CAAP '87, Lecture Notes in Computer Science, Springer-Verlag, Heidelberg,249:123–137 (1986).Google Scholar
  13. 13.
    M. Broy and T. Steicher, Views of Distributed Systems, Proc. Advanced School on Mathematical Models for the Semantics of Parallelism. Lecture Notes in Computer Science, Springer-Verlag, Heidelberg,280:114–143 (1987).Google Scholar
  14. 14.
    Ph. Darondeau and L. Kott, On the Observational Semantics of Fair Parallelism, in Proc. ICALP, Lecture Notes in Computer Science, Springer-Verlag, Heidelberg, 147–151 (1983).Google Scholar
  15. 15.
    P. Degano and U. Montanari, A Model of Distributed Systems Based on Graph Rewriting,Journal of ACM,34:411–449 (1987).Google Scholar
  16. 16.
    P. Degano and U. Montanari, Concurrent Histories: A Basis for Observing Distributed Systems,Journal of Computer and System Sciences,34:442–461 (1987).Google Scholar
  17. 17.
    L. Lamport, Time, Clocks and the Ordering of Events in a Distributed System,Communication of ACM,12:558–564 (1978).Google Scholar
  18. 18.
    M. Nielsen, G. Plotkin, G. Winskel, Petri Nets, Event Structures and Domains, Part 1,Theoret. Comput. Sci.,13:85–108 (1981).Google Scholar
  19. 19.
    C. A. Petri, Concurrency, inNet Theory and Applications Lecture Notes in Computer Science, Springer-Verlag, Heidelberg,84:1–19 (1980).Google Scholar
  20. 20.
    J. Winkowski, Behaviours of Concurrent Systems,Theoretical Computer Science 12:39–60 (1980).Google Scholar
  21. 21.
    G. Winskel, Petri Nets, Algebras, Morphisms and Compositionality,Info. and Co.,72:197–238 (1987).Google Scholar
  22. 22.
    U. Goltz and W. Reisig, The Non-sequential Behaviour of Petri Nets,Info. and Co. 57:125–147 (1983).Google Scholar
  23. 23.
    P. Degano, R. De Nicola, and U. Montanari, CCS is an (Augmented) Contact-Free Condition/Event System, Proc. Advanced School on Mathematical Models for the Semantics of Parallelism. Lecture Notes in Computer Science, Springer-Verlag, Heidelberg,280:144–165 (1987).Google Scholar
  24. 24.
    P. Degano, R. Nicola, and U. Montanari, A Distributed Operational Semantics for CCS based on Condition/Event Systems. Nota Interna B4-21 (IEI, 1987). (to appear inActa Informatica).Google Scholar
  25. 25.
    P. Degano, R. Gorrieri, and S. Marchetti, An Exercise in Concurrency: A CSP Process as a C/E System, inAdvances in Petri Nets 1988 Lecture Notes in Computer Science, Springer-Verlag, Heidelberg (1988) (to appear).Google Scholar
  26. 26.
    R. Milner, Fully Abstract Models for Typed Lambda-Calculi,Theoret. Comput. Sci.,4:1–23 (1977).Google Scholar
  27. 27.
    E.-R. Olderog, Operational Petri Net Semantics for CCSP. InAdvances in Petri Nets 1987, G. Rozenberg, (ed.) Lecture Notes in Computer Science, Springer-Verlag, Heidelberg,266:196–223 (1987).Google Scholar
  28. 28.
    A. Mazurkiewicz, Concurrent Program Schemas and Their Interpretation, Proc. Aarhus Workshop on Verification of Parallel Programs, (1977).Google Scholar

Copyright information

© Plenum Publishing Corporation 1987

Authors and Affiliations

  • Pierpaolo Degano
    • 1
  • Sergio Marchetti
    • 2
  1. 1.Dipartimento di InformaticaUniversità di PisaPISAItaly
  2. 2.Selenia S.p.A.ROMAItaly

Personalised recommendations