Timed (or Stochastic) Data Flow Diagrams (TDFD's or SDFD's) introduced in [SB96b] are an extension of the Formalized Data Flow Diagrams, de ned in [LWBL96]. This extension allows us to assess the quantitative behavior (e. g., performance, throughput, average load of a bubble, etc.) as well as the qualitative behavior (e. g., deadlock, reachability, termination, niteness, liveness, etc.), eventu...

It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterministic) pushdown automata where the pushdown behaves like a counter. Also niteness up to bisimilarity is shown to be decidable for the mentioned processes. 3

This paper considers bandwidth selection for spectral density estimators based on panel data sets. The spectral densities of greatest interest in this paper are the ones that appear in the bias expression for …xed e¤ects estimators in nonlinear dynamic panel models obtained by Hahn and Kuersteiner. The bias estimation problem is di¤erent from the usual HAC estimation problem because the need fo...

Three important problems in the study of grasping and manipulation by multi ngered robotic hands are: (a) Given a grasp characterized by a set of contact points and the associated contact models, determine if the grasp has force closure; (b) If the grasp does not have force closure, determine if the ngers are able to apply a speci ed resultant wrench on the object; and (c) Compute \optimal" con...

In this paper we study the properties of a compositional semantics for logic programs and its applications to modular analysis and logic-based databases, focusing on programs deened on a nite domain (i.e. on a function free nite signature). By this restriction we obtain a nite characterization of the compositional semantics which has the same correctness and compositionality properties of the o...

Existing approaches to deal with sets in a CLP framework generally assume the niteness of the subjacent sets: that is a reason why intensional sets are often forbidden. In this paper, we propose a new compilation method to treat intensional sets in a general setting. Our representation relies on a simply typed-calculus: sets are considered as Boolean-valued functions that may involve union and ...

We consider the veriication problem for timed programs which requirements speciication is given in a rst order logic with explicit time (that is in a rather general setting), and program speciication is represented by a timed automaton. We formalize an observation concerning some practical systems of control which is related to their ""niteness". Algorithm of control often memorizes and uses on...

This paper discusses a case of syntax/semantics interaction of a characteristically optimality-theoretic kind. Finnish partitive constructions exhibit a case alternation that is partly semantically, partly syntactically driven. The crucial semantic condition that plays a role in case selection is quantitative determinacy, which replaces the de niteness condition familiar from the Partitive Cons...

When an inverse problem can be formulated so the data are minima of one of the variational problems of mathematical physics, feasibility constraints can be found for the nonlinear inversion problem. These constraints guarantee that optimal solutions of the inverse problem lie in the convex feasible region of the model space. Furthermore, points on the boundary of this convex region can be found...

By a Calabi-Yau threefold we mean a minimal complex projective threefold X such that O X (K X) ' O X and h 1 (O X) = 0. This paper consists of four parts. In Section 1 we formulate an equivariant version of Torelli Theorem of K3 surface with a nite group action and deduce some more geometrical consequences. In Section 2, we classify Calabi-Yau threefolds with innnite fundamental group by means ...