3,675 research outputs found
Approaching the Coverability Problem Continuously
The coverability problem for Petri nets plays a central role in the
verification of concurrent shared-memory programs. However, its high
EXPSPACE-complete complexity poses a challenge when encountered in real-world
instances. In this paper, we develop a new approach to this problem which is
primarily based on applying forward coverability in continuous Petri nets as a
pruning criterion inside a backward coverability framework. A cornerstone of
our approach is the efficient encoding of a recently developed polynomial-time
algorithm for reachability in continuous Petri nets into SMT. We demonstrate
the effectiveness of our approach on standard benchmarks from the literature,
which shows that our approach decides significantly more instances than any
existing tool and is in addition often much faster, in particular on large
instances.Comment: 18 pages, 4 figure
Forward Analysis and Model Checking for Trace Bounded WSTS
We investigate a subclass of well-structured transition systems (WSTS), the
bounded---in the sense of Ginsburg and Spanier (Trans. AMS 1964)---complete
deterministic ones, which we claim provide an adequate basis for the study of
forward analyses as developed by Finkel and Goubault-Larrecq (Logic. Meth.
Comput. Sci. 2012). Indeed, we prove that, unlike other conditions considered
previously for the termination of forward analysis, boundedness is decidable.
Boundedness turns out to be a valuable restriction for WSTS verification, as we
show that it further allows to decide all -regular properties on the
set of infinite traces of the system
A New Algebraization of the Lame Equation
We develop a new way of writing the Lame Hamiltonian in Lie-algebraic form.
This yields, in a natural way, an explicit formula for both the Lame
polynomials and the classical non-meromorphic Lame functions in terms of
Chebyshev polynomials and of a certain family of weakly orthogonal polynomialsComment: Latex2e with AMS-LaTeX and cite packages; 32 page
Quasi-Exact Solvability and the direct approach to invariant subspaces
We propose a more direct approach to constructing differential operators that
preserve polynomial subspaces than the one based on considering elements of the
enveloping algebra of sl(2). This approach is used here to construct new
exactly solvable and quasi-exactly solvable quantum Hamiltonians on the line
which are not Lie-algebraic. It is also applied to generate potentials with
multiple algebraic sectors. We discuss two illustrative examples of these two
applications: an interesting generalization of the Lam\'e potential which
posses four algebraic sectors, and a quasi-exactly solvable deformation of the
Morse potential which is not Lie-algebraic.Comment: 17 pages, 3 figure
Automatic Verification of Erlang-Style Concurrency
This paper presents an approach to verify safety properties of Erlang-style,
higher-order concurrent programs automatically. Inspired by Core Erlang, we
introduce Lambda-Actor, a prototypical functional language with
pattern-matching algebraic data types, augmented with process creation and
asynchronous message-passing primitives. We formalise an abstract model of
Lambda-Actor programs called Actor Communicating System (ACS) which has a
natural interpretation as a vector addition system, for which some verification
problems are decidable. We give a parametric abstract interpretation framework
for Lambda-Actor and use it to build a polytime computable, flow-based,
abstract semantics of Lambda-Actor programs, which we then use to bootstrap the
ACS construction, thus deriving a more accurate abstract model of the input
program. We have constructed Soter, a tool implementation of the verification
method, thereby obtaining the first fully-automatic, infinite-state model
checker for a core fragment of Erlang. We find that in practice our abstraction
technique is accurate enough to verify an interesting range of safety
properties. Though the ACS coverability problem is Expspace-complete, Soter can
analyse these verification problems surprisingly efficiently.Comment: 12 pages plus appendix, 4 figures, 1 table. The tool is available at
http://mjolnir.cs.ox.ac.uk/soter
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems
We prove a general finite convergence theorem for "upward-guarded" fixpoint
expressions over a well-quasi-ordered set. This has immediate applications in
regular model checking of well-structured systems, where a main issue is the
eventual convergence of fixpoint computations. In particular, we are able to
directly obtain several new decidability results on lossy channel systems.Comment: 16 page
Convex Hull of Arithmetic Automata
Arithmetic automata recognize infinite words of digits denoting
decompositions of real and integer vectors. These automata are known expressive
and efficient enough to represent the whole set of solutions of complex linear
constraints combining both integral and real variables. In this paper, the
closed convex hull of arithmetic automata is proved rational polyhedral.
Moreover an algorithm computing the linear constraints defining these convex
set is provided. Such an algorithm is useful for effectively extracting
geometrical properties of the whole set of solutions of complex constraints
symbolically represented by arithmetic automata
Solutions for the General, Confluent and Biconfluent Heun equations and their connection with Abel equations
In a recent paper, the canonical forms of a new multi-parameter class of Abel
differential equations, so-called AIR, all of whose members can be mapped into
Riccati equations, were shown to be related to the differential equations for
the hypergeometric 2F1, 1F1 and 0F1 functions. In this paper, a connection
between the AIR canonical forms and the Heun General (GHE), Confluent (CHE) and
Biconfluent (BHE) equations is presented. This connection fixes the value of
one of the Heun parameters, expresses another one in terms of those remaining,
and provides closed form solutions in terms of pFq functions for the resulting
GHE, CHE and BHE, respectively depending on four, three and two irreducible
parameters. This connection also turns evident what is the relation between the
Heun parameters such that the solutions admit Liouvillian form, and suggests a
mechanism for relating linear equations with N and N-1 singularities through
the canonical forms of a non-linear equation of one order less.Comment: Original version submitted to Journal of Physics A: 16 pages, related
to math.GM/0002059 and math-ph/0402040. Revised version according to
referee's comments: 23 pages. Sign corrected (June/17) in formula (79).
Second revised version (July/25): 25 pages. See also
http://lie.uwaterloo.ca/odetools.ht
Zero-temperature generalized phase diagram of the 4d transition metals under pressure
We use an accurate implementation of density functional theory (DFT) to
calculate the zero-temperature generalized phase diagram of the 4 series of
transition metals from Y to Pd as a function of pressure and atomic number
. The implementation used is full-potential linearized augmented plane waves
(FP-LAPW), and we employ the exchange-correlation functional recently developed
by Wu and Cohen. For each element, we obtain the ground-state energy for
several crystal structures over a range of volumes, the energy being converged
with respect to all technical parameters to within meV/atom. The
calculated transition pressures for all the elements and all transitions we
have found are compared with experiment wherever possible, and we discuss the
origin of the significant discrepancies. Agreement with experiment for the
zero-temperature equation of state is generally excellent. The generalized
phase diagram of the 4 series shows that the major boundaries slope towards
lower with increasing for the early elements, as expected from the
pressure induced transfer of electrons from states to states, but are
almost independent of for the later elements. Our results for Mo indicate a
transition from bcc to fcc, rather than the bcc-hcp transition expected from
- transfer.Comment: 28 pages and 10 figures. Submitted to Phys. Rev.
- âŠ