Abstract
Synchronization languages are a model used to describe the behaviors of distributed applications whose synchronization constraints are expressed by synchronization expressions. Synchronization languages were conjectured by Guo, Salomaa and Yu to be characterized by a rewriting system. We have shown that this conjecture is not true. This negative result has led us to extend the rewriting system and Salomaa and Yu to extend the definition of synchronization languages. The aim of this paper is to establish the link between these two extensions, we show that the behaviors expressed by the two families of synchronization languages are only separated by morphisms.
Preview
Unable to display preview. Download preview PDF.
References
Clerbout, M., Roos, Y., and Ryl, I. Synchronization languages. Theoretical Computer Science. to appear.
Clerbout, M., Roos, Y., and Ryl, I. About synchronization languages (full version). Tech. Rep. IT-98-313, Université des Sciences et Technologies de Lille, 1998.
Clerbout, M., Roos, Y., and Ryl, I. Langages de synchronisation et systèmes de réécriture. Tech. Rep. IT-98-311, Université des Sciences et Technologies de Lille, 1998.
Diekert, V., and Rozenberg, G., Eds. The Book of Traces. World Scientific, Singapore, 1995.
Govindarajan, R., Guo, L., Yu, S., and Wang, P. ParC project: Practical constructs for parallel programming languages. In Proc. IEEE 15th Annual Internationnal Computer Software & Applications Conference (1991), pp. 183–189.
Guo, L., Salomaa, K., and Yu, S. On synchronization languages. Fundamenta Informaticae 25 (1996), 423–436.
Ryl, I., Roos, Y., and Clerbout, M. Partial characterization of synchronization languages. In Proc. 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS'97) (Bratislava, Slovakia, 1997), I. Prívara and P. RuŽička, Eds., vol. 1295 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 209–218.
Salomaa, K., and Yu, S. Rewriting rules for synchronization languages. In Structures in Logic and Computer Science, a Selection of Essays in Honor of A. Ehrenfeucht, J. Mycielski, G. Rozenberg, and A. Salomaa, Eds., vol. 1261 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1997, pp. 322–338.
Sassone, V., Nielsen, M., and Winskel, G. Models for concurrency: Towards a classification. Theoretical Computer Science 170, 1–2 (1996), 297–348.
van Glabbeck, R. J., and Vaandrager, F. The difference between splitting in n and n + 1. Information and Computation 136, 2 (1997), 109–142.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ryl, I., Roos, Y., Clerbout, M. (1998). About synchronization languages. In: Brim, L., Gruska, J., Zlatuška, J. (eds) Mathematical Foundations of Computer Science 1998. MFCS 1998. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055803
Download citation
DOI: https://doi.org/10.1007/BFb0055803
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64827-7
Online ISBN: 978-3-540-68532-6
eBook Packages: Springer Book Archive