The effect of Vector synchronization: Residue and loss

  • N. W. Keesmaat
  • H. C. M. Kleijn
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 609)


In a Vector Controlled Concurrent System (VCCS) a fixed number of sequential processes operate under the control of a vector synchronization mechanism. Thus, the original behaviour of each of the component processes is constrained by the control mechanism. This observation leads to the introduction of the notion of residue (the remaining behaviour possibilities) and the complementary notion of loss (of behaviour possibilities). For various submodels of the general VCCS model obtained by varying the classes of component processes and by varying the synchronization mechanism, we characterize in a language theoretical sense their residue families and their loss families. In addition we establish for these VCCS submodels the borderline between decidable and undecidable emptiness and finiteness problems for the corresponding families of losses and residues.


vector synchronization Vector Controlled Concurrent Systems residual behaviour vector languages formal languages 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Arn82]
    Arnold, A.: Synchronized behaviours of processes and rational relations. Acta Informatica 17 (1982), pp. 21–29.Google Scholar
  2. [BakBoo74]
    Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. Journal of Computer and System Sciences 8 (1974), pp. 315–332.Google Scholar
  3. [BeaNiv80]
    Beauquier, J., Nivat, M.: Application of formal language theory to problems of security and synchronization. In: Book, R. (ed.): Formal Language Theory: Perspectives and Open Problems. Academic Press, New York (1980), pp. 407–453.Google Scholar
  4. [Ber79]
    Berstel, J.: Transductions and Context-Free Languages. Teubner, Stuttgart (1979).Google Scholar
  5. [Bes87]
    Best, E.: COSY: its relation to nets and to CSP. Lecture Notes in Computer Science 255, Springer-Verlag (1987), pp. 416–440.Google Scholar
  6. [CamHab74]
    Campbell, R.H., Habermann, A.N.: The specification of process synchronization by path expressions. Lecture Notes in Computer Science 16, Springer-Verlag (1974), pp. 89–102.Google Scholar
  7. [Gre69]
    Greibach, S.: An infinite hierarchy of context-free languages, Journal of the Association for Computing Machinery 16 (1969), pp. 91–106.Google Scholar
  8. [HopUl179]
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Massachusetts (1979).Google Scholar
  9. [Imm88]
    Immerman, N.: Nondeterministic space is closed under complementation, SIAM Journal on Computing 17 (1988), pp. 935–938.Google Scholar
  10. [Jan85]
    Janicki, R.: Transforming sequential systems into concurrent systems. Theoretical Computer Science 36 (1985), pp. 27–58.Google Scholar
  11. [JanLauKouDev86]
    Janicki, R., Lauer, P.E., Koutny, M., Devillers, R.: Concurrent and maximally concurrent evolution of nonsequential systems. Theoretical Computer Science 43 (1986), pp. 213–238.Google Scholar
  12. [KeeKleRoz90]
    Keesmaat, N.W., Kleijn, H.C.M., Rozenberg, G.: Vector controlled concurrent systems, part I: basic classes. Fundamenta Informaticae 13 (1990), pp. 275–316.Google Scholar
  13. [KeeKleRoz91]
    Keesmaat, N.W., Kleijn, H.C.M., Rozenberg, G.: Vector controlled concurrent systems, part II: comparisons. Fundamenta Informaticae 14 (1991), pp. 1–38.Google Scholar
  14. [KeeKle89]
    Keesmaat, N.W., Kleijn, H.C.M.: Net-based control versus rational control in vector controlled concurrent systems. Techn. report 89-21, Department of Computer Science, Leiden University (1989). Submitted.Google Scholar
  15. [LauCam75]
    Lauer, P.E., Campbell, R.H.: Formal semantics for a class of high level primitives for coordinating concurrent processes. Acta Informatica 5 (1975), pp. 297–332.Google Scholar
  16. [Niv68]
    Nivat, M.: Transductions des langages de Chomsky. Annales de l'Institut Fourier 18 (1968), pp. 339–456.Google Scholar
  17. [Niv82]
    Nivat, M.:Behaviours of processes and synchronized systems of processes. In: Broy, M., Schmidt, G. (eds.): Theoretical Foundations of Programming Methodology. Reidel Publishing Company, Dordrecht (1982), pp. 473–551.Google Scholar
  18. [Shi79]
    Shields, M.W.: Adequate path expressions. Lecture Notes in Computer Science 70, Springer-Verlag (1979), pp. 249–265.Google Scholar
  19. [Sze88]
    Szelepcsényi, R.: The method of forced enumeration for nondeterministic automata, Acta Informatica 26 (1988), pp. 279–284.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • N. W. Keesmaat
    • 1
  • H. C. M. Kleijn
    • 2
  1. 1.PTT Research Neher LaboratoryAK LeidschendamThe Netherlands
  2. 2.Department of Computer ScienceLeiden UniversityRA LeidenThe Netherlands

Personalised recommendations