134 search results - page 22 / 27 » Discrete Time Process Algebra with Abstraction |
DATE
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—The SPEEDS project is aimed at making rich components models (RCM) into a mature framework in all phases of the design of complex distributed embedded systems. The RCM m...
COMPGEOM
2010
ACM
14 years 16 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
COMPGEOM
2004
ACM
14 years 27 days ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
SIAMCO
2008
13 years 7 months ago
2008
Abstract. In this paper we consider a class of hybrid stochastic games with the piecewise openloop information structure. These games are indexed over a parameter which represents...
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract— Recursive state estimation is considered for discrete time linear systems with mixed process and measurement disturbances that have stochastic and (convex) set-bounded ...