Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
References
Arnold, A.: Synchronized behaviours of processes and rational relations. Acta Informatica 17 (1982), pp. 21–29.
Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. Journal of Computer and System Sciences 8 (1974), pp. 315–332.
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.
Berstel, J.: Transductions and Context-Free Languages. Teubner, Stuttgart (1979).
Best, E.: COSY: its relation to nets and to CSP. Lecture Notes in Computer Science 255, Springer-Verlag (1987), pp. 416–440.
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.
Greibach, S.: An infinite hierarchy of context-free languages, Journal of the Association for Computing Machinery 16 (1969), pp. 91–106.
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Massachusetts (1979).
Immerman, N.: Nondeterministic space is closed under complementation, SIAM Journal on Computing 17 (1988), pp. 935–938.
Janicki, R.: Transforming sequential systems into concurrent systems. Theoretical Computer Science 36 (1985), pp. 27–58.
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.
Keesmaat, N.W., Kleijn, H.C.M., Rozenberg, G.: Vector controlled concurrent systems, part I: basic classes. Fundamenta Informaticae 13 (1990), pp. 275–316.
Keesmaat, N.W., Kleijn, H.C.M., Rozenberg, G.: Vector controlled concurrent systems, part II: comparisons. Fundamenta Informaticae 14 (1991), pp. 1–38.
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.
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.
Nivat, M.: Transductions des langages de Chomsky. Annales de l'Institut Fourier 18 (1968), pp. 339–456.
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.
Shields, M.W.: Adequate path expressions. Lecture Notes in Computer Science 70, Springer-Verlag (1979), pp. 249–265.
Szelepcsényi, R.: The method of forced enumeration for nondeterministic automata, Acta Informatica 26 (1988), pp. 279–284.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Keesmaat, N.W., Kleijn, H.C.M. (1992). The effect of Vector synchronization: Residue and loss. In: Rozenberg, G. (eds) Advances in Petri Nets 1992. Lecture Notes in Computer Science, vol 609. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55610-9_173
Download citation
DOI: https://doi.org/10.1007/3-540-55610-9_173
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55610-7
Online ISBN: 978-3-540-47258-2
eBook Packages: Springer Book Archive