In this paper, we deal with the observability problem of a class of Hybrid Systems whose
output is a timed string on a finite alphabet. We determine under which conditions it is always …

This monograph identifies polytopes that are" combinatorially ℓ1-embeddable", within
interesting lists of polytopal graphs, ie such that corresponding polytopes are either prominent …

We consider the problem of listing faces of the Minkowski sum of several V-polytopes in R^ d.
An algorithm for listing all faces of dimension up to j is presented, for any given 0<= j<= d-1…

This paper deals with the problem of safety verification of nonlinear hybrid systems. We start
from a classical method that uses interval arithmetic to check whether trajectories can move …

All lectures are held in the main lecture hall, Max Bell 159. Please note that the meeting space
designated for BIRS is the lower level of Max Bell, Rooms 155-159. Please respect that all …

This book results in part from lectures held by the first author at the Pedagogical University
of Bydgoszcz in 1984-85. A part of the present text C chapters I, II, IV) is a revised version of …

In this paper, we present the necessary and sufficient conditions of two finite classes of
samples that can be separated by a hyperplane in terms of support vectors which are just the …

For polytopes P, Q⊂ R d we consider the intersection P∪ Q; the convex hull of the union CH
(P∪ Q); and the Minkowski sum P+ Q. We prove that given rational H-polytopes P 1, P 2, Q …

This note summarizes recent results from computational geometry which determine complexity
of computing Minkowski sum of k convex polytopes in Rd, which are represented either in …

§ 1. Introduction and Key Lemma. In an inverse problem, we are required to determine
coefficients in a partial differential equation in order that the solution to the differential equation …