Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
298
A New Class of Decidable Hybrid Systems
- In Hybrid Systems : Computation and Control
, 1999
"... One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed automata, multirate automata, and rectangular automata. In this paper, we extend the decidability frontier for classes of lin ..."
Abstract
-
Cited by 109 (8 self)
- Add to MetaCart
of linear hybrid systems, which are introduced as hybrid systems with linear vector fields in each discrete location. This result is achieved by showing that any such hybrid system admits a finite bisimulation, and by providing an algorithm that computes it using decision methods from mathematical logic.
Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems
, 2000
"... . In this paper we describe an experimental system called d=dt for approximating reachable states for hybrid systems whose continuous dynamics is defined by linear differential equations. We use an approximation algorithm whose accumulation of errors during the continuous evolution is much small ..."
Abstract
-
Cited by 140 (31 self)
- Add to MetaCart
of the major problems in hybrid systems research [G96,GM98,DM98,KV97,V98,GM99,CK99,PSK99,HHMW99]. It constitutes a prerequisite for exporting algorithmic verification methodology outside discrete systems or hybrid systems with piecewise-trivial dynamics. For computer scientists it poses new challenges
Coil sensitivity encoding for fast MRI. In:
- Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract
-
Cited by 193 (3 self)
- Add to MetaCart
, sampling along a Cartesian grid in k-space corresponding to standard Fourier imaging with reduced FOV. Owing to the underlying principle, the concepts outlined in this work have been named SENSE, short for SENSitivity Encoding (8-10). Together with SENSE theory and methods, a detailed SNR analysis
Ordered Upwind Methods for Static Hamilton-Jacobi Equations: Theory and Algorithms
, 2003
"... We develop a family of fast methods for approximating the solutions to a wide class of static Hamilton–Jacobi PDEs; these fast methods include both semi-Lagrangian and fully Eulerian versions. Numerical solutions to these problems are typically obtained by solving large systems of coupled nonlinear ..."
Abstract
-
Cited by 136 (9 self)
- Add to MetaCart
. Next, we introduce a set of finite-differences methods based on an analysis of the role played by anisotropy in the context of front propagation and optimal trajectory problems. The performance of the methods is analyzed, and computational experiments are performed using test problems from
Theorem Proving with the Real Numbers
, 1996
"... This thesis discusses the use of the real numbers in theorem proving. Typically, theorem provers only support a few `discrete' datatypes such as the natural numbers. However the availability of the real numbers opens up many interesting and important application areas, such as the verification ..."
Abstract
-
Cited by 119 (13 self)
- Add to MetaCart
the rigorous definitional construction of the real numbers, using a new version of Cantor's method, and the formalization of a significant portion of real analysis. We also describe an advanced derived decision procedure for the `Tarski subset' of real algebra as well as some more modest
Asynchronous Hybrid Systems with Jumps - Analysis and Synthesis Methods
, 1997
"... In this paper we show that the H∞ synthesis problem for a class of linear systems with asynchronous jumps can be reduced to a purely discrete time synthesis problem. The sytem class considered includes continuous-time systems with discrete jumps, or discontinuities, in the state. New techn ..."
Abstract
-
Cited by 11 (0 self)
- Add to MetaCart
In this paper we show that the H∞ synthesis problem for a class of linear systems with asynchronous jumps can be reduced to a purely discrete time synthesis problem. The sytem class considered includes continuous-time systems with discrete jumps, or discontinuities, in the state. New
The hybrid boundary element method
- Boundary Elements IX, Vol 1: Mathematical and Computational Aspects, Computational Mechanics Publications
, 1987
"... The hybrid stress boundary element method (HSBEM) was introduced in 1987 on the basis of the Hellinger-Reissner potential, as a generalization of Pian’s hybrid finite element method. This new two-field formulation makes use of fundamental solutions to interpolate the stress field in the domain of an ..."
Abstract
-
Cited by 7 (5 self)
- Add to MetaCart
The hybrid stress boundary element method (HSBEM) was introduced in 1987 on the basis of the Hellinger-Reissner potential, as a generalization of Pian’s hybrid finite element method. This new two-field formulation makes use of fundamental solutions to interpolate the stress field in the domain
Stochastic geometry modelling of hybrid wireless/optical networks.
, 2003
"... We propose a new method for the economic evaluation of hybrid fixed wireless/optical access networks. These networks are costeffective solutions in countries with a limited infrastructure. The evaluation of the cost function of such networks requires a detailed description of their spatial features ..."
Abstract
- Add to MetaCart
We propose a new method for the economic evaluation of hybrid fixed wireless/optical access networks. These networks are costeffective solutions in countries with a limited infrastructure. The evaluation of the cost function of such networks requires a detailed description of their spatial features
A Framework for the Analysis of Error in Global Illumination Algorithms
, 1994
"... In this paper we identify sources of error in global illumination algorithms and derive bounds for each distinct category. Errors arise from three sources: inaccuracies in the boundary data, discretization, and computation. Boundary data consist of surface geometry, reflectance functions, and emissi ..."
Abstract
-
Cited by 70 (3 self)
- Add to MetaCart
In this paper we identify sources of error in global illumination algorithms and derive bounds for each distinct category. Errors arise from three sources: inaccuracies in the boundary data, discretization, and computation. Boundary data consist of surface geometry, reflectance functions
Analysis of Hybrid Systems: An ounce of realism can save an infinity of states
- CSL, volume 1683 of LNCS
, 1999
"... Hybrid automata have been introduced in both control engineering and computer science as a formal model for the dynamics of hybrid discrete-continuous systems. In the case of so-called linear hybrid automata this formalization supports semi-decision procedures for state reachability, yet no decision ..."
Abstract
-
Cited by 41 (3 self)
- Add to MetaCart
no decision procedures due to inherent undecidability. Thus, unlike finite or timed automata, already linear hybrid automata are out-of-scope of fully automatic verification. In this article, we devise a new semi-decision method for safety of linear and polynomial hybrid systems which may only fail
Results 1 - 10
of
298
