Current state and perspectives of development of the theory of timed languages are analyzed. A large list of open problems is suggested. 1 Why study timed systems? In most cases computer science deals with sequences of events or actions (we will call them behaviors). Powerful formalisms have been developed to express sets or trees of such sequences (various automata, grammars, expressions, proc...

This article is an overview of the recent developments of a theory originally introduced by Leifer and Milner: given a formalism with a reduction semantics, a canonical labelled transition system is derived on which bisimilarity as well as other other equivalences are congruences, provided that the contexts of the formalism form the arrows of a category which has certain colimits. We shall also...

The first experiment involved the intelligibility of alternated speech. In a typical experiment by Cherry and Taylor, and later by Huggins,2 a continuous speech message was periodically switched alternately to the subject's left and right ears, so that one ear received speech, while the other received silence. The intelligibility was assessed by counting the number of words the subject was able...

In this paper, we survey some of the results which have been obtained the last ten years on the control of hybrid and timed systems.

Fair cake-cutting is the division of a cake or resource among N users so that each user is content. Users may value a given piece of cake differently, and information about how a user values different parts of the cake can only be obtained by requesting users to “cut” pieces of the cake into specified ratios. Many distributed computing problems which involve resource sharing can be expressed as...

We discuss session types independently of any programming language. We then embody the notion in languages from three different paradigms: the pi calculus, a functional language, and an object-oriented language.