
doi: 10.1007/bfb0029964
Synchronization languages are associated with synchronization expressions, a high-level construct which allows a programmer to express synchronization constraints in a distributed context. We give a negative answer to a conjecture enunciated by L. Guo, K. Salomaa and S. Yu which aims at characterizing synchronization languages in terms of regular languages closed under a rewriting system. Then we propose an extension of the system which gives a positive answer for a class of regular languages.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
