Effective-Range Expansion of the Neutron-Deuteron Scattering Studied by a Quark-Model Nonlocal Gaussian Potential

The S-wave effective range parameters of the neutron-deuteron (nd) scattering are derived in the Faddeev formalism, using a nonlocal Gaussian potential based on the quark-model baryon-baryon interaction fss2. The spin-doublet low-energy eigenphase shift is sufficiently attractive to reproduce predictions by the AV18 plus Urbana three-nucleon force, yielding the observed value of the doublet scattering length and the correct differential cross sections below the deuteron breakup threshold. This conclusion is consistent with the previous result for the triton binding energy, which is nearly reproduced by fss2 without reinforcing it with the three-nucleon force.Comment: 21 pages, 6 figures and 6 tables, submitted to Prog. Theor. Phy

Testing deterministic implementations from nondeterministic FSM specifications

In this paper, conformance testing of protocols specified as nondeterministic finite state machines is considered. Protocol implementations are assumed to be deterministic. In this testing scenario, the conformance relation becomes a preorder, so-called reduction relation between FSMs. The reduction relation requires that an implementation machine produces a (sub)set of output sequences that can be produced by its specification machine in response to every input sequence. A method for deriving tests with respect to the reduction relation with full fault coverage for deterministic implementations is proposed based on certain properties of the product of specification and implementation machines. Keywords Conformance testing, test derivation, fault detection, I/O nondeterministic FSMs, equivalence and reduction relations 1 INTRODUCTION Conformance testing of protocol implementations is often formalized as the FSM equivalence problem (Moore, 1956) and (Hennie, 1964). In particular, we ..

Response of one-year-old planted native grasses to controlled burns

Verification of timed bisimulation equivalence is generally difficult because of state explosion caused by concrete time values. In this paper, we propose a verification method to verify timed bisimulation equivalence of two timed processes using a symbolic technique similar to (Hennessy and Lin 1995). We first propose a new model of timed processes, Alternating Timed Symbolic Labelled Transition System(A-TSLTS). In A-TSLTS, each state has some parameter variables and those values determine its behaviour. Each transition in an A-TSLTS has a guard predicate. The transition is executable if and only if its guard predicate is true under specified parameter values. In the proposed method, we can obtain the weakest condition for a state-pair in a finite A-TSLTS to make the state-pair be timed bisimulation equivalent. We also show that this result can be applied to the language LOTOS/T(Nakata et al. 1994), a timed extension of LOTOS(ISO 1989)