Relativistic bound-state equations in three dimensions

Firstly, a systematic procedure is derived for obtaining three-dimensional bound-state equations from four-dimensional ones. Unlike ``quasi-potential approaches'' this procedure does not involve the use of delta-function constraints on the relative four-momentum. In the absence of negative-energy states, the kernels of the three-dimensional equations derived by this technique may be represented as sums of time-ordered perturbation theory diagrams. Consequently, such equations have two major advantages over quasi-potential equations: they may easily be written down in any Lorentz frame, and they include the meson-retardation effects present in the original four-dimensional equation. Secondly, a simple four-dimensional equation with the correct one-body limit is obtained by a reorganization of the generalized ladder Bethe-Salpeter kernel. Thirdly, our approach to deriving three-dimensional equations is applied to this four-dimensional equation, thus yielding a retarded interaction for use in the three-dimensional bound-state equation of Wallace and Mandelzweig. The resulting three-dimensional equation has the correct one-body limit and may be systematically improved upon. The quality of the three-dimensional equation, and our general technique for deriving such equations, is then tested by calculating bound-state properties in a scalar field theory using six different bound-state equations. It is found that equations obtained using the method espoused here approximate the wave functions obtained from their parent four-dimensional equations significantly better than the corresponding quasi-potential equations do.Comment: 28 pages, RevTeX, 6 figures attached as postscript files. Accepted for publication in Phys. Rev. C. Minor changes from original version do not affect argument or conclusion

Equational reasoning with context-free families of string diagrams

String diagrams provide an intuitive language for expressing networks of interacting processes graphically. A discrete representation of string diagrams, called string graphs, allows for mechanised equational reasoning by double-pushout rewriting. However, one often wishes to express not just single equations, but entire families of equations between diagrams of arbitrary size. To do this we define a class of context-free grammars, called B-ESG grammars, that are suitable for defining entire families of string graphs, and crucially, of string graph rewrite rules. We show that the language-membership and match-enumeration problems are decidable for these grammars, and hence that there is an algorithm for rewriting string graphs according to B-ESG rewrite patterns. We also show that it is possible to reason at the level of grammars by providing a simple method for transforming a grammar by string graph rewriting, and showing admissibility of the induced B-ESG rewrite pattern.Comment: International Conference on Graph Transformation, ICGT 2015. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-21145-9_

Computation of Buffer Capacities for Throughput Constrained and Data Dependent Inter-Task Communication

Streaming applications are often implemented as task graphs. Currently, techniques exist to derive buffer capacities that guarantee satisfaction of a throughput constraint for task graphs in which the inter-task communication is data-independent, i.e. the amount of data produced and consumed is independent of the data values in the processed stream. This paper presents a technique to compute buffer capacities that satisfy a throughput constraint for task graphs with data dependent inter-task communication, given that the task graph is a chain. We demonstrate the applicability of the approach by computing buffer capacities for an MP3 playback application, of which the MP3 decoder has a variable consumption rate. We are not aware of alternative approaches to compute buffer capacities that guarantee satisfaction of the throughput constraint for this application

A graph semantics for a variant of the ambient calculus more adequate for modeling SOC

In this paper we present a graph semantics of a variant of the well known ambient calculus. The main change of our variant is to extract the mobility commands of the original calculus from the ambient topology. Similar to a previous work of ours, we prove that our encoding have good properties. We strongly believe that this variant would allow us to integrate our graph semantics of our mobile calculus with previous work of us in service oriented computing (SOC). Basically, our work on SOC develops a new graph transformation system which we call temporal symbolic graphs. This new graph formalism is used to give semantics to a design language for SOC developed in an european project, but it could also be used in connection with other approaches for modeling or specifying service systems.Postprint (published version