Related papers: State and history in operating systems
Recursive techniques have recently been introduced into quantum programming so that a variety of large quantum circuits and algorithms can be elegantly and economically programmed. In this paper, we present a proof system for formal…
The state complexity of the result of a regular operation is often positively correlated with the number of distinct transformations induced by letters in the minimal deterministic finite automaton of the input languages. That is, more…
Multistate models offer a powerful framework for studying disease processes and can be used to formulate intensity-based and more descriptive marginal regression models. They also represent a natural foundation for the construction of joint…
The methods of statistical physics of open systems are used for describing the time dependence of economic characteristics (income, profit, cost, supply, currency etc.) and their correlations with each other. Nonlinear equations (analogies…
Automata over infinite objects are a well-established model with applications in logic and formal verification. Traditionally, acceptance in such automata is defined based on the set of states visited infinitely often during a run. However,…
Many regenerative arguments in stochastic processes use random times which are akin to stopping times, but which are determined by the future as well as the past behaviour of the process of interest. Such arguments based on "conditioning on…
We review progress on questions related to front propagation into unstable states and point out open problems in the area. We strive to highlight different theoretical perspectives and challenges while also addressing more practical…
We discuss quantum information processing machines. We start with single purpose machines that either redistribute quantum information or identify quantum states. We then move on to machines that can perform a number of functions, with the…
The process of technological change can be regarded as a non-deterministic system governed by factors of a cumulative nature that generate cyclical phenomena. In this context, the process of growth and decline of technology can be…
Game-theoretic dynamics between AI agents could differ from traditional human-human interactions in various ways. One such difference is that it may be possible to accurately simulate an AI agent, for example because its source code is…
We study a proof methodology for verifying the safety of data invariants of highly-available distributed applications that replicate state. The proof is (1) modular: one can reason about each individual operation separately, and (2)…
We present a closed-form, computable expression for the expected number of times any transition event occurs during the transient phase of a reducible Markov chain. Examples of events include time to absorption, number of visits to a state,…
Asynchronous events sequences are widely distributed in the natural world and human activities, such as earthquakes records, users activities in social media and so on. How to distill the information from these seemingly disorganized data…
The availability of interaction devices has raised interest in techniques to support the user interface (UI). A UI specification describes the functions that a system provides to its users by capturing the interface details and includes…
To promote the global search ability of the original state transition algorithm, a new operator called axesion is suggested, which aims to search along the axes and strengthen single dimensional search. Several benchmark minimization…
The career of an employee can be described (under certain circumstances) by a random walk, where the states of the random walk are determined by the level and position of an employee. At each decision moment the state of the employee is…
We briefly review simulation schemes for the investigation of rare transitions and we resume the recently introduced Transition Interface Sampling, a method in which the computation of rate constants is recast into the computation of fluxes…
We present a method for analyzing general time series by employing the history state formalism of quantum mechanics. This formalism allows us to describe a complete evolution based on a single quantum state, the history state, which…
Systems of differential equations with state-dependent delay are considered. The delay dynamically depends on the state i.e. is governed by an additional differential equation. By applying the time transformations we arrive to constant…
Having a broad range of methods available for implementing unitary operations is crucial for quantum information tasks. We study a dissipative process commonly used to describe dissipatively coupled systems and show that the process can…