On synchronization languages

Fundamenta Informaticae

Volumn 25, Issue 3-4, 1996, Pages 423-436

  Guo, L ^a   Salomaa, K ^b   Yu, S ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

^b UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013367744     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1996-253412     Document Type: Article

References (25)

1. I.J. Aalbersberg and G. Rozenberg, "Theory of Traces", Theoretical Computer Science 60 (1988) 1-82.
2. S. Andler, "Predicate path expressions", Proc. 6th ACM Symp. on Principles of Programming Languages (1979) 226-236.
3. J.C.M. Baeten and W.P. Weijland, Process Algebra, Cambridge University Press, Cambridge 1990.
4. J.A. Bergstra and J.W. Klop, "Algebra of communicating processes with abstraction", Theoret. Comput. Sci. 37(1) (1985) pp.77-121
5. G. Boudel and I. Castellani, "On the sematices of concurrency: partial orders and transition systems", in Proc. TAPSOFT'87, Lecture Notes in Computer Science, Vol. 249 (Spinger, Berlin, 1987), pp.123-137
6. S.D. Brookes, C.A.R. Hoare and A.W. Roscoe, "A theory of Communicating sequential processes", JACM, Vol.31, No3, July, 1984, pp.560-599
7. R.H. Campbell and A.N. Habermann, "The Specification of process synchronization by path expression", Lecture Notes in Computer Science, vol. 16, Springer-Verlag, New York, 89-102, 1974.
8. R. Govindarajan, L. Guo, S. Yu, P. Wang, "ParC Project: Practical Constructs for Parallel Programming Languages" IEEE Proceedings of the 15th Annual International Computer Software & Applications Conference, 1991.
9. L. Guo, S. Yu, "Synchronization Expressions in Parallel Programming Languages" Technical Report, Dept. of Computer Science, University of Western Ontario, Canada.
10. M. Hennessy, Algebraic Theory of Processes, The MIT Press, Cambridge, Mass. 1989.
11. C.A.R. Hoare, "Communicating Sequential Processes", Communications of the ACM, 21(8), 666-677, 1978.
12. T. Jiang, A. Salomaa, K. Salomaa, S. Yu, "Inclusion is undecidable for pattern languages", Proceedings of ICALP'93, Springer Lect. Notes Comput. Sci. 700, pp. 301-312
13. S.R. Kosaraju, "Limitations of Dijkstra's semaphore primitives and Petri nets", Operating Systems Review, 7, 4 (Oct. 1973) pp.122-126
14. S. Lafortune and H. Yoo, "Some results on Petri net languages", IEEE Transactions on Automatic Control, 1990, Vol. 35, Iss 4, pp.482-485
15. A. Mazurkiewicz, "Trace Theory", Lecture Notes in Computer Science 255, Springer 1986.
16. R. Milner, "A Calculus of Communicating Systems", Lecture Notes in Computer Science, Vol. 92, (Springer, Berlin, 1980)
17. R. Milner, "Calculi for Synchrony and Asynchrony", Theoretical Computer Science, 25(1983), pp.267-310
18. R. Milner, "Lectures on a Calculus for Communicating Systems", Seminar on Concurrency, Lecture Notes in Computer Science, 13 (1981), pp.197-220
19. T. Murale, "Petri nets - properties, analysis and applications", Proceedings of the IEEE, 1989, Vol. 77, Iss. 4, pp.541-580
20. M. Nielsen, G. Plotkin and G. Winskel, "Petri Nets, Event Structures and Domains", Theoretical Computer Science, 13 (1981), pp.85-108
21. J.L. Peterson, "Petri Nets" Computing Survey, Vol.9, No 3, Sept. 1977, pp.223-252
22. J. L. Peterson, Petri Net theory and the Modeling of Systems, Prentice-Hall, 1981
23. A. Petit, "Distribution and synchronized automata", Theoretical Computer Science 76(1990) pp.285-308
24. G. Rozenberg and R. Verraedt, "Subset languages of Petri nets", Theoretical Computer Science, 26, (1983), pp.301-326;
25. K. Salomaa, S. Yu, Q. Zhuang, "On the state complexity of some basic operations on regular languages", Theoretical Computer Science, to appear.