44,659 research outputs found
On the equivalence of game and denotational semantics for the probabilistic mu-calculus
The probabilistic (or quantitative) modal mu-calculus is a fixed-point logic
de- signed for expressing properties of probabilistic labeled transition
systems (PLTS). Two semantics have been studied for this logic, both assigning
to every process state a value in the interval [0,1] representing the
probability that the property expressed by the formula holds at the state. One
semantics is denotational and the other is a game semantics, specified in terms
of two-player stochastic games. The two semantics have been proved to coincide
on all finite PLTS's, but the equivalence of the two semantics on arbitrary
models has been open in literature. In this paper we prove that the equivalence
indeed holds for arbitrary infinite models, and thus our result strengthens the
fruitful connection between denotational and game semantics. Our proof adapts
the unraveling or unfolding method, a general proof technique for proving
result of parity games by induction on their complexity
Measurement of Resonance Parameters of Orbitally Excited Narrow B^0 Mesons
We report a measurement of resonance parameters of the orbitally excited
(L=1) narrow B^0 mesons in decays to B^{(*)+}\pi^- using 1.7/fb of data
collected by the CDF II detector at the Fermilab Tevatron. The mass and width
of the B^{*0}_2 state are measured to be m(B^{*0}_2) =
5740.2^{+1.7}_{-1.8}(stat.) ^{+0.9}_{-0.8}(syst.) MeV/c^2 and \Gamma(B^{*0}_2)
= 22.7^{+3.8}_{-3.2}(stat.) ^{+3.2}_{-10.2}(syst.) MeV/c^2. The mass difference
between the B^{*0}_2 and B^0_1 states is measured to be
14.9^{+2.2}_{-2.5}(stat.) ^{+1.2}_{-1.4}(syst.) MeV/c^2, resulting in a B^0_1
mass of 5725.3^{+1.6}_{-2.2}(stat.) ^{+1.4}_{-1.5}(syst.) MeV/c^2. This is
currently the most precise measurement of the masses of these states and the
first measurement of the B^{*0}_2 width.Comment: 7 pages, 1 figure, 1 table. Submitted to Phys.Rev.Let
Measurement of the fraction of t-tbar production via gluon-gluon fusion in p-pbar collisions at sqrt(s)=1.96 TeV
We present a measurement of the ratio of t-tbar production cross section via
gluon-gluon fusion to the total t-tbar production cross section in p-pbar
collisions at sqrt{s}=1.96 TeV at the Tevatron. Using a data sample with an
integrated luminosity of 955/pb recorded by the CDF II detector at Fermilab, we
select events based on the t-tbar decay to lepton+jets. Using an artificial
neural network technique we discriminate between t-tbar events produced via
q-qbar annihilation and gluon-gluon fusion, and find
Cf=(gg->ttbar)/(pp->ttbar)<0.33 at the 68% confidence level. This result is
combined with a previous measurement to obtain the most precise measurement of
this quantity, Cf=0.07+0.15-0.07.Comment: submitted to Phys. Rev.
On Second-Order Monadic Monoidal and Groupoidal Quantifiers
We study logics defined in terms of second-order monadic monoidal and
groupoidal quantifiers. These are generalized quantifiers defined by monoid and
groupoid word-problems, equivalently, by regular and context-free languages. We
give a computational classification of the expressive power of these logics
over strings with varying built-in predicates. In particular, we show that
ATIME(n) can be logically characterized in terms of second-order monadic
monoidal quantifiers
Search for lepton flavor violating decays of a heavy neutral particle in p-pbar collisions at root(s)=1.8 TeV
We report on a search for a high mass, narrow width particle that decays
directly to e+mu, e+tau, or mu+tau. We use approximately 110 pb^-1 of data
collected with the Collider Detector at Fermilab from 1992 to 1995. No evidence
of lepton flavor violating decays is found. Limits are set on the production
and decay of sneutrinos with R-parity violating interactions.Comment: Figure 2 fixed. Reference 4 fixed. Minor changes to tex
Classical BI: Its Semantics and Proof Theory
We present Classical BI (CBI), a new addition to the family of bunched logics
which originates in O'Hearn and Pym's logic of bunched implications BI. CBI
differs from existing bunched logics in that its multiplicative connectives
behave classically rather than intuitionistically (including in particular a
multiplicative version of classical negation). At the semantic level,
CBI-formulas have the normal bunched logic reading as declarative statements
about resources, but its resource models necessarily feature more structure
than those for other bunched logics; principally, they satisfy the requirement
that every resource has a unique dual. At the proof-theoretic level, a very
natural formalism for CBI is provided by a display calculus \`a la Belnap,
which can be seen as a generalisation of the bunched sequent calculus for BI.
In this paper we formulate the aforementioned model theory and proof theory for
CBI, and prove some fundamental results about the logic, most notably
completeness of the proof theory with respect to the semantics.Comment: 42 pages, 8 figure
Target company cross-border effects in acquisitions into the UK
We analyse the abnormal returns to target shareholders in crossborder and domestic acquisitions of UK companies. The crossborder effect during the bid month is small (0.84%), although crossborder targets gain significantly more than domestic targets during the months surrounding the bid. We find no evidence for the level of abnormal returns in crossborder acquisitions to be associated with market access or exchange rate effects, and only limited support for an international diversification effect. However, the crossborder effect appears to be associated with significant payment effects, and there is no significant residual crossborder effect once various bid characteristics are controlled for
Software Model Checking with Explicit Scheduler and Symbolic Threads
In many practical application domains, the software is organized into a set
of threads, whose activation is exclusive and controlled by a cooperative
scheduling policy: threads execute, without any interruption, until they either
terminate or yield the control explicitly to the scheduler. The formal
verification of such software poses significant challenges. On the one side,
each thread may have infinite state space, and might call for abstraction. On
the other side, the scheduling policy is often important for correctness, and
an approach based on abstracting the scheduler may result in loss of precision
and false positives. Unfortunately, the translation of the problem into a
purely sequential software model checking problem turns out to be highly
inefficient for the available technologies. We propose a software model
checking technique that exploits the intrinsic structure of these programs.
Each thread is translated into a separate sequential program and explored
symbolically with lazy abstraction, while the overall verification is
orchestrated by the direct execution of the scheduler. The approach is
optimized by filtering the exploration of the scheduler with the integration of
partial-order reduction. The technique, called ESST (Explicit Scheduler,
Symbolic Threads) has been implemented and experimentally evaluated on a
significant set of benchmarks. The results demonstrate that ESST technique is
way more effective than software model checking applied to the sequentialized
programs, and that partial-order reduction can lead to further performance
improvements.Comment: 40 pages, 10 figures, accepted for publication in journal of logical
methods in computer scienc
Critical Realism and Statistical Methods: A Response to Nash
This article offers a defence of critical realism in the face of objections Nash (2005) makes to it in a recent edition of this journal. It is argued that critical and scientific realisms are closely related and that both are opposed to statistical positivism. However, the suggestion is made that scientific realism retains (from statistical positivism) a number of elements that result in misleading accounts of social processes and events: indicators are used which do not reflect the close relationship between structure and agency; indicators refer to reified and not real properties of both structures and agents; and indicators do not refer to causal properties of objects and entities. In order to develop a narrative of causal processes, as Nash argues researchers should, then some adjustments need to be made to the principles that underpin scientific realism
Existential witness extraction in classical realizability and via a negative translation
We show how to extract existential witnesses from classical proofs using
Krivine's classical realizability---where classical proofs are interpreted as
lambda-terms with the call/cc control operator. We first recall the basic
framework of classical realizability (in classical second-order arithmetic) and
show how to extend it with primitive numerals for faster computations. Then we
show how to perform witness extraction in this framework, by discussing several
techniques depending on the shape of the existential formula. In particular, we
show that in the Sigma01-case, Krivine's witness extraction method reduces to
Friedman's through a well-suited negative translation to intuitionistic
second-order arithmetic. Finally we discuss the advantages of using call/cc
rather than a negative translation, especially from the point of view of an
implementation.Comment: 52 pages. Accepted in Logical Methods for Computer Science (LMCS),
201
- …