FG h S h UWU i SU¥ § © h SI h SQ i'w Q\ac 4 aY w UYU f KY o TQQU a U jcao Q hh UQV\ac
4 h A n 5 5 E h T ««Q h VQ f V a T h V w Q jahh W r W [WV k V af Q ª UQV w Q 5©¤ jcaj Q c …

Deterministic behavior for parallel and distributed computation is rather difficult to ensure. To
reach that goal, many formal calculi, languages, and techniques with well-defined semantics …

We present an efficient algorithm to determine the maximal class of confluent τ-transitions in
a labelled transition system. Confluent τ-transitions are inert with respect to branching …

Degree: Fil. Dr. DegreeYear: 1998 Institute: Uppsala Universitet (Sweden) Publisher:
Department Of Computer Systems, Uppsala University, Box 325, S-751 05 Uppsala …

Abstract The Frequency Assignment Problem (FAP) in radio networks is the problem of
assigning frequencies to transmitters exploiting frequency reuse while keeping signal …

This article presents a static system for checking determinism (technically, partial
confluence) of communicating concurrent processes. Our approach automatically detects …

We extend the linear {\pi}-calculus with composite regular types in such a way that data
containing linear values can be shared among several processes, if there is no overlapping …

In the design of mobile agent programming languages there is a tension between the
implementation cost and the expressiveness of the communication mechanisms provided …

We extend the linear π-calculus with composite and equi-recursive types in a way that
enables the sharing of data containing linear values, provided that there is no overlapping …

We present a capability calculus for checking partial confluence of channel-communicating
concurrent processes. Our approach automatically detects more programs to be partially …