We consider solutions uf to the one-dimensional Robin problem with heat source f∈L1[−π,π] and parameter α>0. For given m, M, s, 0≤m<s<M, we identify sources f0, such that uf0 maximizes temperature gap max[−π,π]⁡uf−min[−π,π]⁡uf over all f m≤f≤M ‖f‖L1=2πs. In particular, this answers a question raised by J. Langford P. McDonald in [5]. also sources, which maximize/minimize at point x0∈[−π,π] same...

We present the analysis of a protocol for private authentication in the applied pi calculus. We treat authenticity and secrecy properties of the protocol. Although such properties are fairly standard, their formulation in the applied pi calculus makes an original use of process equivalences. In addition, we treat identity-protection properties, which are a delicate concern in several recent pro...

Traditional IDLs present some limitations, since they were defined for describing the services that objects offer, but not those services they require from other objects, nor the partial ordering in which their services are expected to be used. In this paper we propose an IDL extension that uses a subset of π-calculus for describing objects service protocols. Our approach can be also used in a ...

We study natural semantic fragments of the π-calculus: depthbounded processes (there is a bound on the longest communication path), breadth-bounded processes (there is a bound on the number of parallel processes sharing a name), and name-bounded processes (there is a bound on the number of shared names). We give a complete characterization of the decidability frontier for checking if a π-calcul...

Let P and Q denote processes. Then • P | Q denotes a process composed of P and Q running in parallel. • a(x).P denotes a process that waits to read a value x from the channel a and then, having received it, behaves like P. • ā〈x〉.P denotes a process that first waits to send the value x along the channel a and then, after x has been accepted by some input process, behaves like P. • (νa)P ensures...