155 research outputs found
Incremental, Inductive Coverability
We give an incremental, inductive (IC3) procedure to check coverability of
well-structured transition systems. Our procedure generalizes the IC3 procedure
for safety verification that has been successfully applied in finite-state
hardware verification to infinite-state well-structured transition systems. We
show that our procedure is sound, complete, and terminating for downward-finite
well-structured transition systems---where each state has a finite number of
states below it---a class that contains extensions of Petri nets, broadcast
protocols, and lossy channel systems.
We have implemented our algorithm for checking coverability of Petri nets. We
describe how the algorithm can be efficiently implemented without the use of
SMT solvers. Our experiments on standard Petri net benchmarks show that IC3 is
competitive with state-of-the-art implementations for coverability based on
symbolic backward analysis or expand-enlarge-and-check algorithms both in time
taken and space usage.Comment: Non-reviewed version, original version submitted to CAV 2013; this is
a revised version, containing more experimental results and some correction
Integral closure of rings of integer-valued polynomials on algebras
Let be an integrally closed domain with quotient field . Let be a
torsion-free -algebra that is finitely generated as a -module. For every
in we consider its minimal polynomial , i.e. the
monic polynomial of least degree such that . The ring consists of polynomials in that send elements of back to
under evaluation. If has finite residue rings, we show that the
integral closure of is the ring of polynomials in which
map the roots in an algebraic closure of of all the , ,
into elements that are integral over . The result is obtained by identifying
with a -subalgebra of the matrix algebra for some and then
considering polynomials which map a matrix to a matrix integral over . We
also obtain information about polynomially dense subsets of these rings of
polynomials.Comment: Keywords: Integer-valued polynomial, matrix, triangular matrix,
integral closure, pullback, polynomially dense set. accepted for publication
in the volume "Commutative rings, integer-valued polynomials and polynomial
functions", M. Fontana, S. Frisch and S. Glaz (editors), Springer 201
Nets, relations and linking diagrams
In recent work, the author and others have studied compositional algebras of
Petri nets. Here we consider mathematical aspects of the pure linking algebras
that underly them. We characterise composition of nets without places as the
composition of spans over appropriate categories of relations, and study the
underlying algebraic structures.Comment: 15 pages, Proceedings of 5th Conference on Algebra and Coalgebra in
Computer Science (CALCO), Warsaw, Poland, 3-6 September 201
Quaternion-Octonion SU(3) Flavor Symmetry
Starting with the quaternionic formulation of isospin SU(2) group, we have
derived the relations for different components of isospin with quark states.
Extending this formalism to the case of SU(3) group we have considered the
theory of octonion variables. Accordingly, the octonion splitting of SU(3)
group have been reconsidered and various commutation relations for SU(3) group
and its shift operators are also derived and verified for different iso-spin
multiplets i.e. I, U and V- spins.
Keywords: SU(3), Quaternions, Octonions and Gell Mann matrices
PACS NO: 11.30.Hv: Flavor symmetries; 12.10-Dm: Unified field theories and
models of strong and electroweak interaction
Quaternion Octonion Reformulation of Quantum Chromodynamics
We have made an attempt to develop the quaternionic formulation of Yang -
Mill's field equations and octonion reformulation of quantum chromo dynamics
(QCD). Starting with the Lagrangian density, we have discussed the field
equations of SU(2) and SU(3) gauge fields for both cases of global and local
gauge symmetries. It has been shown that the three quaternion units explain the
structure of Yang- Mill's field while the seven octonion units provide the
consistent structure of SU(3)_{C} gauge symmetry of quantum chromo dynamics
Some Additive Combinatorics Problems in Matrix Rings
We study the distribution of singular and unimodular matrices in sumsets in
matrix rings over finite fields. We apply these results to estimate the largest
prime divisor of the determinants in sumsets in matrix rings over the integers
Knaster's problem for -symmetric subsets of the sphere
We prove a Knaster-type result for orbits of the group in
, calculating the Euler class obstruction. Among the consequences
are: a result about inscribing skew crosspolytopes in hypersurfaces in , and a result about equipartition of a measures in
by -symmetric convex fans
Octonion Quantum Chromodynamics
Starting with the usual definitions of octonions, an attempt has been made to
establish the relations between octonion basis elements and Gell-Mann \lambda
matrices of SU(3)symmetry on comparing the multiplication tables for Gell-Mann
\lambda matrices of SU(3)symmetry and octonion basis elements. Consequently,
the quantum chromo dynamics (QCD) has been reformulated and it is shown that
the theory of strong interactions could be explained better in terms of
non-associative octonion algebra. Further, the octonion automorphism group
SU(3) has been suitably handled with split basis of octonion algebra showing
that the SU(3)_{C}gauge theory of colored quarks carries two real gauge fields
which are responsible for the existence of two gauge potentials respectively
associated with electric charge and magnetic monopole and supports well the
idea that the colored quarks are dyons
On the ratio of consecutive gaps between primes
In the present work we prove a common generalization of Maynard-Tao's recent
result about consecutive bounded gaps between primes and on the
Erd\H{o}s-Rankin bound about large gaps between consecutive primes. The work
answers in a strong form a 60 years old problem of Erd\"os, which asked whether
the ratio of two consecutive primegaps can be infinitely often arbitrarily
small, and arbitrarily large, respectively
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability/coverability problem. We show that the minimal costs are computable if all storage/transition costs are non-negative, while even the question of zero-cost coverability is undecidable in the case of general integer costs.
- …