Sciweavers

3458 search results - page 278 / 692
» Abstracting Control
Sort
View
SPIN
2000
Springer
15 years 7 months ago
Communication Topology Analysis for Concurrent Programs
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...
Matthieu Martel, Marc Gengler
HYBRID
1995
Springer
15 years 7 months ago
Deciding Reachability for Planar Multi-polynomial Systems
Abstract. In this paper we investigate the decidability of the reachability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state spa...
Karlis Cerans, Juris Viksna
ICCAD
1995
IEEE
114views Hardware» more  ICCAD 1995»
15 years 7 months ago
Sequential synthesis using S1S
Abstract—We propose the use of the logic S1S as a mathematical framework for studying the synthesis of sequential designs. We will show that this leads to simple and mathematical...
Adnan Aziz, Felice Balarin, Robert K. Brayton, Alb...
147
Voted
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 7 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
CDC
2009
IEEE
123views Control Systems» more  CDC 2009»
15 years 7 months ago
Dealing with stochastic reachability
Abstract— For stochastic hybrid systems, stochastic reachability is very little supported mainly because of complexity and difficulty of the associated mathematical problems. In...
Manuela L. Bujorianu