Related papers: Resourceful Traces for Commuting Processes
Capabilities (whether object or reference capabilities) are fundamentally tools to restrict effects. Thus static capabilities (object or reference) and effect systems take different technical machinery to the same core problem of statically…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
An advantage of scientific workflow systems is their ability to collect runtime provenance information as an execution trace. Traces include the computation steps invoked as part of the workflow run along with the corresponding data…
Reversible computing is a new paradigm that has emerged recently and extends the traditional forwards-only computing mode with the ability to execute in backwards, so that computation can run in reverse as easily as in forward. Two…
Trace formulae provide one of the most elegant descriptions of the classical-quantum correspondence. One side of a formula is given by a trace of a quantum object, typically derived from a quantum Hamiltonian, and the other side is…
Establishing cutoff, an abrupt transition from "not mixed" to "well mixed", is a classical topic in the theory of mixing times for Markov chains. Interest has grown recently in determining not only the existence of cutoff and the order of…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
We introduce a denotational semantic framework for shared-memory concurrent programs in a C11-style memory model. This denotational approach is an alternative to techniques based on "execution graphs" and axiomatizations, and it allows for…
We present a new compressed representation of free trajectories of moving objects. It combines a partial-sums-based structure that retrieves in constant time the position of the object at any instant, with a hierarchical…
Previous proposals to permit non-exponential free-path statistics in radiative transfer have not included support for volume and boundary sources that are spatially uncorrelated from the scattering events in the medium. Birth-collision free…
Physical processes are computations only when we use them to externalize thought. Computation is the performance of one or more fixed processes within a contingent environment. We reformulate the Church-Turing thesis so that it applies to…
We model quantum transport, described by continuous-time quantum walks (CTQW), on deterministic Sierpinski fractals, differentiating between Sierpinski gaskets and Sierpinski carpets, along with their dual structures. The transport…
In contrast with classical approaches, we present the project based on considering Collective Behaviours as coherent sequences of states adopted by different single systems consisting of the same elements interacting over time in different…
Activity analysis in which multiple people interact across a large space is challenging due to the interplay of individual actions and collective group dynamics. We propose an end-to-end approach for learning person trajectory…
Networks with a high degree of symmetry are useful models for parallel processor networks. In earlier papers, we defined several global communication tasks (universal exchange, universal broadcast, universal summation) that can be critical…
We develop the idea of non-Markovian CTRW (continuous time random walk) approximation to the evolution of interacting particle systems, which leads to a general class of fractional kinetic measure-valued evolutions with variable order. We…
In this paper, we define and study the concept of traceable regressions. These are sequences of regressions in joint or single responses for which a corresponding regression graph captures not only an independence structure but represents,…
Ostrowski's theorem implies that $\log(x),\log(x+1),\ldots$ are algebraically independent over $\mathbb{C}(x)$. More generally, for a linear differential or difference equation, it is an important problem to find all algebraic dependencies…
Effectful Mealy machines, which we introduce, are a generalization of Mealy machines with global effects determined by an effectful triple. We provide semantics of effectful Mealy machines in terms of both bisimilarity and traces:…
We give a description of traces on C(X)\rtimes G in terms of measurable fields of traces on the C*-algebras of the stabilizers of the action of G on X.