15,586 research outputs found
SAT-Based Synthesis Methods for Safety Specs
Automatic synthesis of hardware components from declarative specifications is
an ambitious endeavor in computer aided design. Existing synthesis algorithms
are often implemented with Binary Decision Diagrams (BDDs), inheriting their
scalability limitations. Instead of BDDs, we propose several new methods to
synthesize finite-state systems from safety specifications using decision
procedures for the satisfiability of quantified and unquantified Boolean
formulas (SAT-, QBF- and EPR-solvers). The presented approaches are based on
computational learning, templates, or reduction to first-order logic. We also
present an efficient parallelization, and optimizations to utilize reachability
information and incremental solving. Finally, we compare all methods in an
extensive case study. Our new methods outperform BDDs and other existing work
on some classes of benchmarks, and our parallelization achieves a super-linear
speedup. This is an extended version of [5], featuring an additional appendix.Comment: Extended version of a paper at VMCAI'1
SAT Modulo Monotonic Theories
We define the concept of a monotonic theory and show how to build efficient
SMT (SAT Modulo Theory) solvers, including effective theory propagation and
clause learning, for such theories. We present examples showing that monotonic
theories arise from many common problems, e.g., graph properties such as
reachability, shortest paths, connected components, minimum spanning tree, and
max-flow/min-cut, and then demonstrate our framework by building SMT solvers
for each of these theories. We apply these solvers to procedural content
generation problems, demonstrating major speed-ups over state-of-the-art
approaches based on SAT or Answer Set Programming, and easily solving several
instances that were previously impractical to solve
Solving Parity Games in Scala
Parity games are two-player games, played on directed graphs, whose nodes are labeled with priorities. Along a play, the maximal priority occurring infinitely often determines the winner. In the last two decades, a variety of algorithms and successive optimizations have been proposed. The majority of them have been implemented in PGSolver, written in OCaml, which has been elected by the community as the de facto platform to solve efficiently parity games as well as evaluate their performance in several specific cases.
PGSolver includes the Zielonka Recursive Algorithm that has been shown to perform better than the others in randomly generated games. However, even for arenas with a few thousand of nodes (especially over dense graphs), it requires minutes to solve the corresponding game.
In this paper, we deeply revisit the implementation of the recursive algorithm introducing several improvements and making use of Scala Programming Language. These choices have been proved to be very successful, gaining up to two orders of magnitude in running time
ECOM: a fast and accurate solver for toroidal axisymmetric MHD equilibria
We present ECOM (Equilibrium solver via COnformal Mapping), a fast and
accurate fixed boundary solver for toroidally axisymmetric magnetohydrodynamic
equilibria with or without a toroidal flow. ECOM combines conformal mapping and
Fourier and integral equation methods on the unit disk to achieve exponential
convergence for the poloidal flux function as well as its first and second
partial derivatives. As a consequence of its high order accuracy, for dense
grids and tokamak-like elongations ECOM computes key quantities such as the
safety factor and the magnetic shear with higher accuracy than the finite
element based code CHEASE [H. L\"utjens \textit{et al.}, Computer physics
communications 97, 219 (1996)] at equal run time. ECOM has been developed to
provide equilibrium quantities and details of the flux contour geometry as
inputs to stability, wave propagation and transport codes.Comment: 25 pages, 9 figure
Moving-boundary problems solved by adaptive radial basis functions
The objective of this paper is to present an alternative approach to the conventional level set methods for solving two-dimensional moving-boundary problems known as the passive transport. Moving boundaries are associated with time-dependent problems and the position of the boundaries need to be determined as a function of time and space. The level set method has become an attractive design tool for tracking, modeling and simulating the motion of free boundaries in fluid mechanics, combustion, computer animation and image processing. Recent research on the numerical method has focused on the idea of using a meshless methodology for the numerical solution of partial differential equations. In the present approach, the moving interface is captured by the level set method at all time with the zero contour of a smooth function known as the level set function. A new approach is used to solve a convective transport equation for advancing the level set function in time. This new approach is based on the asymmetric meshless collocation method and the adaptive greedy algorithm for trial subspaces selection. Numerical simulations are performed to verify the accuracy and stability of the new numerical scheme which is then applied to simulate a bubble that is moving, stretching and circulating in an ambient flow to demonstrate the performance of the new meshless approach. (C) 2010 Elsevier Ltd. All rights reserved
Finite element computation of a viscous compressible free shear flow governed by the time dependent Navier-Stokes equations
A finite element algorithm for solution of fluid flow problems characterized by the two-dimensional compressible Navier-Stokes equations was developed. The program is intended for viscous compressible high speed flow; hence, primitive variables are utilized. The physical solution was approximated by trial functions which at a fixed time are piecewise cubic on triangular elements. The Galerkin technique was employed to determine the finite-element model equations. A leapfrog time integration is used for marching asymptotically from initial to steady state, with iterated integrals evaluated by numerical quadratures. The nonsymmetric linear systems of equations governing time transition from step-to-step are solved using a rather economical block iterative triangular decomposition scheme. The concept was applied to the numerical computation of a free shear flow. Numerical results of the finite-element method are in excellent agreement with those obtained from a finite difference solution of the same problem
Improvements to the construction of binary black hole initial data
Construction of binary black hole initial data is a prerequisite for
numerical evolutions of binary black holes. This paper reports improvements to
the binary black hole initial data solver in the Spectral Einstein Code, to
allow robust construction of initial data for mass-ratio above 10:1, and for
dimensionless black hole spins above 0.9, while improving efficiency for lower
mass-ratios and spins. We implement a more flexible domain decomposition,
adaptive mesh refinement and an updated method for choosing free parameters. We
also introduce a new method to control and eliminate residual linear momentum
in initial data for precessing systems, and demonstrate that it eliminates
gravitational mode mixing during the evolution. Finally, the new code is
applied to construct initial data for hyperbolic scattering and for binaries
with very small separation.Comment: 28 pages, 13 figures, 1 tabl
A Survey of Monte Carlo Tree Search Methods
Monte Carlo tree search (MCTS) is a recently proposed search method that combines the precision of tree search with the generality of random sampling. It has received considerable interest due to its spectacular success in the difficult problem of computer Go, but has also proved beneficial in a range of other domains. This paper is a survey of the literature to date, intended to provide a snapshot of the state of the art after the first five years of MCTS research. We outline the core algorithm's derivation, impart some structure on the many variations and enhancements that have been proposed, and summarize the results from the key game and nongame domains to which MCTS methods have been applied. A number of open research questions indicate that the field is ripe for future work
Adaptive control in rollforward recovery for extreme scale multigrid
With the increasing number of compute components, failures in future
exa-scale computer systems are expected to become more frequent. This motivates
the study of novel resilience techniques. Here, we extend a recently proposed
algorithm-based recovery method for multigrid iterations by introducing an
adaptive control. After a fault, the healthy part of the system continues the
iterative solution process, while the solution in the faulty domain is
re-constructed by an asynchronous on-line recovery. The computations in both
the faulty and healthy subdomains must be coordinated in a sensitive way, in
particular, both under and over-solving must be avoided. Both of these waste
computational resources and will therefore increase the overall
time-to-solution. To control the local recovery and guarantee an optimal
re-coupling, we introduce a stopping criterion based on a mathematical error
estimator. It involves hierarchical weighted sums of residuals within the
context of uniformly refined meshes and is well-suited in the context of
parallel high-performance computing. The re-coupling process is steered by
local contributions of the error estimator. We propose and compare two criteria
which differ in their weights. Failure scenarios when solving up to
unknowns on more than 245\,766 parallel processes will be
reported on a state-of-the-art peta-scale supercomputer demonstrating the
robustness of the method
- …