Some behavioural aspects of net theory

1. Aalbersberg, I.J. and Rozenberg, G.: Theory of Traces. Technical Report 16, Computer Science Department, University of Leiden, Thee Netherlands (1986).

   Google Scholar 

2. Bednarczyk, M.: Categories of Asynchronous Systems, Ph.D. Thesis, Computer Science Department, University of Sussex, Great Britain (1987).

   Google Scholar 

3. Best, E.: A Theorem on the Characteristics of Non-Sequential Processes. Fundamenta Informaticae III. 1 (1980), pp. 77–94.

   Google Scholar 

4. Brauer, W., Reisig, W. and Rozenberg, G. (eds.): Petri Nets: Applications and Relationships to Other Models of Concurrency. LNCS Springer lecture Notes in Computer Science 255 (1987).

   Google Scholar 

5. Choffrut, C.: Free Partially Commutative Monoids. Technical Report 86-20, LITP, University of Paris 7, France (1986).

   Google Scholar 

6. Commoner, F., Holt, A.N., Even, S. and Pnueli, A.: Marked Directed Graphs. Journal of Computer and System Sciences 5 (1971), pp. 511–523.

   Google Scholar 

7. Degano, P., DeNicola, R. and Montanari, U.: A New Operational Semantics for CCS based on Condition/Event Systems. Nota Interna B4-42, Department of Computer Science, University of Pisa, Italy (1986).

   Google Scholar 

8. Fernandez, C. and Thiagarajan, P.S.: D-Continuous Causal Nets: A Model of Non-Sequential Processes. Theoretical Computer Science 28 (1984), pp. 171–196.

   Google Scholar 

9. Fernandez, C., Nielsen, M. and Thiagarajan, P.S.: Notions of Realizable Non-Sequential Processes. Fundamenta Informaticae IX (1986), pp. 421–454.

   Google Scholar 

10. Genrich, H.J.: Predicate/Transition Nets. LNCS 254 (1987), pp. 207–247.

    Google Scholar 

11. Genrich, H.J. and Lautenbach, K.: Synchronisationsgraphen. Acta Informaticae 2 (1973), pp. 143–161.

    Google Scholar 

12. Genrich, H.J. and Lautenbach, K.: System Modelling with High-level Petri Nets. Theoretical Computer Science 13 (1981), pp. 109–136.

    Google Scholar 

13. Hack, M.: Analysis of Production Schemata by Petri Nets. M.S. thesis, TR-94, Project MAC, Department of Electrical Engineering, Massachusetts Institute of Technology, Cambridge, Mass., USA (1972).

    Google Scholar 

14. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall Publishing Company, London, Great Britain (1985).

    Google Scholar 

15. Jantzen, M.: Complexity of Place/Transition Nets. LNCS 254 (1987), pp. 413–435.

    Google Scholar 

16. Jantzen, M.: Language Theory of Petri Nets. LNCS 254 (1987), pp. 397–412.

    Google Scholar 

17. Jensen, K.: Coloured Petri Nets. LNCS 254 (1987), pp. 248–299.

    Google Scholar 

18. Jump, J.R. and Thiagarajan, P.S.: On the Equivalence of Asynchronous Control Structures. SIAM Journal of Computing 2, 2 (1973), pp. 67–87.

    Google Scholar 

19. Karp, R.M. and Miller, R.E.: Parallel Program Schemata. Journal of Computer and System Sciences 3, 2 (1969), pp. 147–195.

    Google Scholar 

20. Lautenbach, K.: Linear Algebraic Techniques for Place/Transition Nets. LNCS 254 (1987), pp. 142–167.

    Google Scholar 

21. Mazurkiewicz, A.: Concurrent Program Schemes and their Interpretations. DAIMI Report PB-78, Computer Science Department, Aarhus University, Denmark (1977).

    Google Scholar 

22. Mazurkiewicz, A.: Semantics of Concurrent Systems: A Modular Fixed-Point Trace Approach. LNCS 188 (1985), pp. 353–375.

    Google Scholar 

23. Milner, R.: A Calculus of Communicating Systems. LNCS Springer lecture Notes in Computer Science 92 (1980).

    Google Scholar 

24. Nielsen, M., Rozenberg, G. and Thiagarajan, P.S.: A Comparison of some Elementary Net-theoretic Behavioural Notions. Manuscript. (To appear soon as an Internal Report of the Computer Science Department, Aarhus University, Denmark.)

    Google Scholar 

25. Nielsen, M., Plotkin, G. and Winskel, G.: Petri Nets, Event Structures and Domains: Part 1. Theoretical Computer Science 13 (1980), pp. 85–108.

    Google Scholar 

26. Olderog, E.R.: Operational Petri Net Semantics for CCSP. LNCS 266 (1987), pp. 196–223.

    Google Scholar 

27. Petri, C.A.: Kommunikation mit Automaten. Schrifften des IIM Nr. 2, Institute für Instrumentelle Mathematik, Bonn University, W. Germany (1962).

    Google Scholar 

28. Petri, C.A.: Non-Sequential Processes. Interner Bericht ISF-77-5, Gesellschaft für Mathematik und Datenverarbeitung, St. Augustin, W. Germany (1977).

    Google Scholar 

29. Petri, C.A.: Concurrency Theory. LNCS 254 (1987), pp. 4–24.

    Google Scholar 

30. Pratt, V.R.: Modelling Concurrency with Partial Orders. International Journal of Parallel Programming 15, 1 (1986), pp. 33–71.

    Google Scholar 

31. Rozenberg, G. and Thiagarajan, P.S.: Petri Nets: Basic Notions, Structure and Behaviour. LNCS 224 (1986), pp. 585–668.

    Google Scholar 

32. Rozoy, B. and Thiagarajan, P.S.: Event Structures and trace Monoids. Report 87-47, LITP, University of Paris 7, France (1987).

    Google Scholar 

33. Starke, P.H.: Traces and Semiwords. LNCS 208 (1985), pp. 332–349.

    Google Scholar 

34. Thiagarajan, P.S.: Elementary Net Systems. LNCS 254 (1987), pp. 26–59.

    Google Scholar 

35. Thiagarajan, P.S. and Voss, K.: A Fresh Look at Free Choice Nets. Information and Control 61, 2 (1984), pp. 85–113.

    Google Scholar 

36. Winskel, G.: Event Structures. LNCS 255 (1987), pp. 325–392.

    Google Scholar 

37. Winskel, G.: Event Structure Semantics of CCS and Related Languages. LNCS Springer lecture Notes in Computer Science 140 (1982).

    Google Scholar 

38. Winskel, G.: Categories of Models for Concurrency. Technical Report no. 58, Computer Laboratory, Cambridge University, Great Britain (1986).

    Google Scholar 

Download references