We study the size and the complexity of computingfinite state automata (FSA) representing and approximatingthe downward and the upward closure of Petri net languageswith coverability as the acceptance condition. We show how toconstruct an FSA recognizing the upward closure of a Petri netlanguage in doubly-exponential time, and therefore the size is atmost doubly exponent...

Real-World Neuroimaging Technologies Report Title Decades of heavy investment in laboratory-based brain imaging and neuroscience have led to foundational insights into how humans sense, perceive, and interact with the external world. However, it is argued that fundamental differences between laboratory-based and naturalistic human behavior may exist. Thus, it remains unclear how well the curren...

searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggesstions for reducing this burden, to Washington Headquarters Services, Directorate for Information Operations and Reports, 1215 Jefferson Davis Hi...

The numerical analytic continuation of a function f(z) = f(x + iy) on a strip is discussed in this paper. The data are only given approximately on the real axis. The periodicity of given data is assumed. A truncated Fourier spectral method has been introduced to deal with the ill-posedness of the problem. The theoretic results show that the discrepancy principle can work well for this problem. ...

In this paper we consider the problem of generating a well sampled discrete representation of the Pareto manifold or the Pareto front corresponding to the equilibrium points of a multi-objective optimization problem. We show how the introduction of simple additional constraints into a continuation procedure produces equispaced points in either of those two sets. Moreover, we describe in detail ...

Globalization strategies are necessary in practical inexact-Newton flow solvers to ensure convergence when the initial iterate is far from the solution. In this work, we present two novel globalizations based on parameter continuation. The first continuation method parameterizes the boundary conditions while the second parameterizes the numerical dissipation. In both cases, a continuation param...

In this paper we compare diierent continuation methods for the searching of periodic orbits of the Froeschl e map, which is a four dimensional symplectic map. We nd relations between the stability of the periodic orbits and the problem to solve the system given in the continuation method.

Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute a finite representation of the set of successors of the downward closure of a state, is harder: Until now, the theoretical framework for manipulating downward-closed sets was missing. We answer this problem, using ins...

La ont and Tirole [3] show that when the uncertainty about the agent's ability is small, the equilibrium must involve a large amount of pooling, but it is not necessary to be a partition equilibrium. They construct a nonpartition continuation equilibrium for a given rst-period menu of contracts and conjecture that this continuation equilibrium need not be suboptimal for the whole game under sma...