Summary
Synchronized behaviours of processes, specified in three different ways, are compared with rational relations.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Arnold, A.: A comparison of three specifications of synchronization constraints. Rapport de Recherche n∘ 5, Laboratoire d'Informatique, Université de Poitiers (1980)
Arnold, A., Nivat, M.: Controlling behaviours of systems: Some basic concepts and some applications. In: 9th Symposium on Mathematical Foundations of Computer Science, Rydzyna 1980 (P. Dembinski, ed.). Lecture Notes in Computer Science, Vol. 88, pp. 113–122. Springer-Verlag (1980)
Campbell, R.M., Habermann, A.N.: The specification of process synchronization by path expressions. In: Operating Systems, Int. Symp. Rocquencourt, 1974 (E. Gelenbe, C. Kaiser, eds.). Lecture Notes in Computer Science, Vol. 16, pp. 89–102. Springer-Verlag (1974)
Dijkstra, E.W.: Co-operating sequential processes. In: Programming Languages (F. Genuys, ed.), Academic Press, New York 1967
Eilenberg, S.: Automata, Languages and Machines, Vol. A. Academic Press, New York 1974
Lauer, P. E., Torrigiani, P.R., Shields, M.W.: COSY. A system specification language based on paths and processes. Acta Informat. 12, 109–158 (1979)
Nivat, M.: Transductions des languages de Chomsky. Ann. Inst. Fourier, Grenoble 18, pp. 339–456 (1968)
Nivat, M.: Sur la synchronisation des processus. Revue Technique Thomson-CSF 11, 889–919 (1979)
Nivat, M.: Infinitary relations. In: CAAP 81, Genoa, 1981 (E. Astesiano, C. Böhm, eds.). Lecture Notes in Computer Science, Vol. 112, pp. 46–75. Springer-Verlag (1981)
Shields, M.W., Lauer, P.E.: A formal semantics for concurrent systems. In: Automata, languages and programming, 6th Colloquium, Graz (H.A. Maureer, ed.). Lecture Notes in Computer Science, Vol. 71, pp. 571–584. Springer-Verlag (1979)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Arnold, A. Synchronized behaviours of processes and rational relations. Acta Informatica 17, 21–29 (1982). https://doi.org/10.1007/BF00262973
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00262973