357 research outputs found

    Solving parity games: Explicit vs symbolic

    Get PDF
    In this paper we provide a broad investigation of the symbolic approach for solving Parity Games. Specifically, we implement in a fresh tool, called, four symbolic algorithms to solve Parity Games and compare their performances to the corresponding explicit versions for different classes of games. By means of benchmarks, we show that for random games, even for constrained random games, explicit algorithms actually perform better than symbolic algorithms. The situation changes, however, for structured games, where symbolic algorithms seem to have the advantage. This suggests that when evaluating algorithms for parity-game solving, it would be useful to have real benchmarks and not only random benchmarks, as the common practice has been

    Reasoning About Strategies: On the Model-Checking Problem

    Full text link
    In open systems verification, to formally check for reliability, one needs an appropriate formalism to model the interaction between agents and express the correctness of the system no matter how the environment behaves. An important contribution in this context is given by modal logics for strategic ability, in the setting of multi-agent games, such as ATL, ATL\star, and the like. Recently, Chatterjee, Henzinger, and Piterman introduced Strategy Logic, which we denote here by CHP-SL, with the aim of getting a powerful framework for reasoning explicitly about strategies. CHP-SL is obtained by using first-order quantifications over strategies and has been investigated in the very specific setting of two-agents turned-based games, where a non-elementary model-checking algorithm has been provided. While CHP-SL is a very expressive logic, we claim that it does not fully capture the strategic aspects of multi-agent systems. In this paper, we introduce and study a more general strategy logic, denoted SL, for reasoning about strategies in multi-agent concurrent games. We prove that SL includes CHP-SL, while maintaining a decidable model-checking problem. In particular, the algorithm we propose is computationally not harder than the best one known for CHP-SL. Moreover, we prove that such a problem for SL is NonElementarySpace-hard. This negative result has spurred us to investigate here syntactic fragments of SL, strictly subsuming ATL\star, with the hope of obtaining an elementary model-checking problem. Among the others, we study the sublogics SL[NG], SL[BG], and SL[1G]. They encompass formulas in a special prenex normal form having, respectively, nested temporal goals, Boolean combinations of goals and, a single goal at a time. About these logics, we prove that the model-checking problem for SL[1G] is 2ExpTime-complete, thus not harder than the one for ATL\star

    Colossal electroresistance and colossal magnetoresistive step in paramagnetic insulating phase of single crystalline bilayered manganite(La0.4_{0.4}Pr0.6_{0.6})1.2_{1.2}Sr1.8_{1.8}Mn2_{2}O7_{7}

    Get PDF
    We report a significant decrease in the low-temperature resistance induced by the application of an electric current on the abab-plane in the paramagnetic insulating (PMI) state of (La0.4_{0.4}Pr0.6_{0.6})1.2_{1.2}Sr1.8_{1.8}Mn2_{2}O7_{7}. A colossal electroresistance effect attaining -95% is observed at lower temperatures. A colossal magnetoresistive step appears near 5T at low temperatures below 10K, accompanied by an ultrasharp width of the insulator-metal transition. Injection of higher currents to the crystal causes a disappearance of the steplike transition. These findings have a close relationship with the presence of the short-range charge-ordered clusters pinned within the PMI matrix of the crystal studied.Comment: 4 pages 3 figure

    Spin-Orbit Force from Lattice QCD

    Get PDF
    We present a first attempt to determine nucleon-nucleon potentials in the parity-odd sector, which appear in 1P1, 3P0, 3P1, 3P2-3F2 channels, in Nf=2 lattice QCD simulations. These potentials are constructed from the Nambu-Bethe-Salpeter wave functions for J^P=0^-, 1^- and 2^-, which correspond to A1^-, T1^- and T2^- + E^- representation of the cubic group, respectively. We have found a large and attractive spin-orbit potential VLS(r) in the isospin-triplet channel, which is qualitatively consistent with the phenomenological determination from the experimental scattering phase shifts. The potentials obtained from lattice QCD are used to calculate the scattering phase shifts in 1P1, 3P0, 3P1 and 3P2-3F2 channels. The strong attractive spin-orbit force and a weak repulsive central force in spin-triplet P-wave channels lead to an attraction in the 3P2 channel, which is related to the P-wave neutron paring in neutron stars.Comment: 14 pages, 5 figures, Physics Letters B published versio

    Kaon-Nucleon potential from lattice QCD

    Full text link
    We study the KN interactions in the I(J^{\pi})=0(1/2^-) and 1(1/2^-) channels and associated exotic state \Theta^+ from 2+1 flavor full lattice QCD simulation for relatively heavy quark mass corresponding to m_{\pi}=871 MeV. The s-wave KN potentials are obtained from the Bethe-Salpeter wave function by using the method recently developed by HAL QCD (Hadrons to Atomic nuclei from Lattice QCD) Collaboration. Potentials in both channels reveal short range repulsions: Strength of the repulsion is stronger in the I=1 potential, which is consistent with the prediction of the Tomozawa-Weinberg term. The I=0 potential is found to have attractive well at mid range. From these potentials, the KNKN scattering phase shifts are calculated and compared with the experimental data.Comment: Talk given at 19th International IUPAP Conference on Few-Body Problems in Physics (fb19), Bonn, Germany, 30 Aug - 5 Sep 200

    Mirage in Temporal Correlation functions for Baryon-Baryon Interactions in Lattice QCD

    Get PDF
    Single state saturation of the temporal correlation function is a key condition to extract physical observables such as energies and matrix elements of hadrons from lattice QCD simulations. A method commonly employed to check the saturation is to seek for a plateau of the observables for large Euclidean time. Identifying the plateau in the cases having nearby states, however, is non-trivial and one may even be misled by a fake plateau. Such a situation takes place typically for the system with two or more baryons. In this study, we demonstrate explicitly the danger from a possible fake plateau in the temporal correlation functions mainly for two baryons (ΞΞ\Xi\Xi and NNNN), and three and four baryons (3He^3{\rm He} and 4He)^4{\rm He}) as well, employing (2+1)-flavor lattice QCD at mπ=0.51m_{\pi}=0.51 GeV on four lattice volumes with L=L= 2.9, 3.6, 4.3 and 5.8 fm. Caution is given for drawing conclusion on the bound NNNN, 3N3N and 4N4N systems only based on the temporal correlation functions.Comment: 32 pages, 13 figures, minor corrections, published version, typos correcte
    corecore