Fast algorithms for handling diagonal constraints in timed automata

A popular method for solving reachability in timed automata proceeds by enumerating reachable sets of valuations represented as zones. A na\"ive enumeration of zones does not terminate. Various termination mechanisms have been studied over the years. Coming up with efficient termination mechanisms has been remarkably more challenging when the automaton has diagonal constraints in guards. In this paper, we propose a new termination mechanism for timed automata with diagonal constraints based on a new simulation relation between zones. Experiments with an implementation of this simulation show significant gains over existing methods.Comment: Shorter version of this article to appear in CAV 201

Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction

Constraint Handling Rules (CHR) is a declarative committed-choice programming language with a strong relationship to linear logic. Its generalization CHR with Disjunction (CHRv) is a multi-paradigm declarative programming language that allows the embedding of horn programs. We analyse the assets and the limitations of the classical declarative semantics of CHR before we motivate and develop a linear-logic declarative semantics for CHR and CHRv. We show how to apply the linear-logic semantics to decide program properties and to prove operational equivalence of CHRv programs across the boundaries of language paradigms

Thresholding methods to estimate the copula density

This paper deals with the problem of the multivariate copula density estimation. Using wavelet methods we provide two shrinkage procedures based on thresholding rules for which the knowledge of the regularity of the copula density to be estimated is not necessary. These methods, said to be adaptive, are proved to perform very well when adopting the minimax and the maxiset approaches. Moreover we show that these procedures can be discriminated in the maxiset sense. We produce an estimation algorithm whose qualities are evaluated thanks some simulation. Last, we propose a real life application for financial data

Thresholding methods to estimate the copula density

This paper deals with the problem of the multivariate copula density estimation. Using wavelet methods we provide two shrinkage procedures based on thresholding rules for which the knowledge of the regularity of the copula density to be estimated is not necessary. These methods, said to be adaptive, are proved to perform very well when adopting the minimax and the maxiset approaches. Moreover we show that these procedures can be discriminated in the maxiset sense. We produce an estimation algorithm whose qualities are evaluated thanks some simulation. Last, we propose a real life application for financial data

Feasibility of reduced gravity experiments involving quiescent, uniform particle cloud combustion

The study of combustible particle clouds is of fundamental scientific interest as well as a practical concern. The principal scientific interests are the characteristic combustion properties, especially flame structure, propagation rates, stability limits, and the effects of stoichiometry, particle type, transport phenomena, and nonadiabatic processes on these properties. The feasibility tests for the particle cloud combustion experiment (PCCE) were performed in reduced gravity in the following stages: (1) fuel particles were mixed into cloud form inside a flammability tube; (2) when the concentration of particles in the cloud was sufficiently uniform, the particle motion was allowed to decay toward quiescence; (3) an igniter was energized which both opened one end of the tube and ignited the suspended particle cloud; and (4) the flame proceeded down the tube length, with its position and characteristic features being photographed by high-speed cameras. Gravitational settling and buoyancy effects were minimized because of the reduced gravity enviroment in the NASA Lewis drop towers and aircraft. Feasibility was shown as quasi-steady flame propagation which was observed for fuel-rich mixtures. Of greatest scientific interest is the finding that for near-stoichiometric mixtures, a new mode of flame propagation was observed, now called a chattering flame. These flames did not propagate steadily through the tube. Chattering modes of flame propagation are not expected to display extinction limits that are the same as those for acoustically undisturbed, uniform, quiescent clouds. A low concentration of fuel particles, uniformly distributed in a volume, may not be flammable but may be made flammable, as was observed, through induced segregation processes. A theory was developed which showed that chattering flame propagation was controlled by radiation from combustion products which heated the successive discrete laminae sufficiently to cause autoignition