Behavioural presentations

  • M. W. Shields
Technical Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 354)


In this paper, we present a general behavioural model for parallel systems and a class of automata which accept them. We discuss the use of such automata in giving uniform, non-interleaving semantics for parallel specification languages.


Parallelism concurrency behavioural presentations event structures transition systems asynchronous automata 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    G. Winskel, “Event Structure Semantics for CCS and Related Languages.,” Tech. Rep. DAIMIPB-159, Computer Science Department, University of Aarhus, April, 1983.Google Scholar
  2. 2.
    A. Mazurkiewicz, “Concurrent Program Schema and their Interpretations,” in Procedings Aarhus Workshop on Verification of Parallel Programs, 1977.Google Scholar
  3. 3.
    M. W. Shields, “Concurrent Machines,” Computer Journal, vol. 28, pp. 449–465, 1985.CrossRefGoogle Scholar
  4. 4.
    M. W. Shields, Elements of a Theory of Parallelism, MIT Press, In Preparation.Google Scholar
  5. 5.
    A. Einstein, Relativity: The Special and General Theory, Methuen.Google Scholar
  6. 6.
    C. A. Petri, “Non-Sequential Processes,” Interner Bericht ISF-77-05, Gesellschaft fur Mathematik und Datenverarbeitung, 1977.Google Scholar
  7. 7.
    M. Neilsen, G. Plotkin, and G. Winskel, “Petri Nets, Event Structures and Domains,” in Proceedings, Symposium on the Semantics of Concurrent Computation, Lecture Notes in Computer Science, vol. 70, pp. 266–283, Springer Verlag, 1979.Google Scholar
  8. 8.
    R. M. Keller, “Formal Verification of Parallel Programs,” CACM, vol. 19(7), 1975.Google Scholar
  9. 9.
    M. A. Bednarcztk, Categories of Asynchronous Systems, Ph.D. Thesis, University of Sussex, October 1987.Google Scholar
  10. 10.
    A. R. J. G. Milner, “Calculi for Synchrony and Asynchrony,” Tech. Rep. CSR-104-82, Computer Science Department, University of Edinburgh, 1982.Google Scholar
  11. 11.
    G. Winskel, Events in Computation,, Ph.D. Thesis, Computer Science Department, University of Sussex, October 1980.Google Scholar
  12. 12.
    H. J. Genrich, K. Lautenbach, and P. S. Thiagarajan, “Elements of General Net Theory,” in Proceedings, Advanced Course on General Net Theory of Processes and Systems, Lecture Notes in Computer Science, vol. 84, pp. 21–164, Springer Verlag, 1979.Google Scholar
  13. 13.
    A. R. J. G. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, 92, Springer Verlag, 1980.Google Scholar
  14. 14.
    C. A. R. Hoare, Communicating Sequential Processes, Prentice-Hall International Series in Computer Science, 1985.Google Scholar
  15. 15.
    G. Costa and C. Stirling, “Fair Calculus of Communicating Systems,” Tech. Rep. CSR-137-83, Computer Science Department, University of Edinburgh, 1983.Google Scholar
  16. 16.
    M. W. Shields, “Algebraic Models of Parallelism and Net Theory,” in Concurrency and Nets, ed. K. Voss, H. J. Genrich and G. Rozenburg, pp. 423–434, Springer Verlag, 1987.Google Scholar
  17. 17.
    R. Janicki, “A Formal Semantics for Concurrent Systems with a Priority Relation,” Tech. Rep. R 84-16, Institut for Elektroniske Systemer, University of Aalborg, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • M. W. Shields
    • 1
  1. 1.Electronic Engineering LaboratoriesThe University of Kent at CanterburyUnited Kingdom

Personalised recommendations