This paper introduces the notion of Asymptotic and Finite Time Abstraction, as a way to map
a hybrid automaton to a timed automaton. The abstraction procedure discards the …

We give one formulation of a procedure of Hanany and Vegh (J High Energy Phys 0710(029):35,
2007) which takes a lattice polygon as an input and produces a set of isoradial dimer …

It's coming to the end of the calendar year and a lot of people are producing lists. What were
the 10 largest box-office blockbusters? What were the 10 best movies of the year? Who are …

We present a technique for synthesizing switching guards for hybrid systems by using sum
of squares (SOS) programming. The guards are defined to be semialgebraic sets calculated …

We show that every n-point tree metric admits a (1+ ε)-embedding into l^ sup C (ε) log n^^
sub 1^, for every ε> 0, where.... This matches the natural volume lower bound up to a factor …

The article deals with the approximation of the solution set and the reachable sets of an
impulsive differential inclusion with variable times of impulses. It is strongly connected to [ 11 ] …

A toric arrangement is a finite set of hypersurfaces in a complex torus, every hypersurface
being the kernel of a character. In the present paper, we build a CW-complex homotopy …

For hybrid systems, hybrid automata based tools are capable of verification while Matlab
Simulink/Stateflow is proficient in simulation. In this paper, a methodology is developed in …

We present in this paper an improved estimation of duality gap between binary quadratic
program and its Lagrangian dual. More specifically, we obtain this improved estimation using a …

We present a bit-precise decision procedure for the theory of binary floating-point arithmetic.
The core of our approach is a non-trivial generalisation of the conflict analysis algorithm …