Results 11  20
of
7,034
Approximate Reachability Analysis of PiecewiseLinear 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
. 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
An analysis of BGP convergence properties
 In SIGCOMM
"... The Border Gateway Protocol (BGP) is the de facto interdomain routing protocol used to exchange reachability information between Autonomous Systems in the global Internet. BGP is a pathvector protocol that allows each Autonomous System to override distancebased metrics with policybased metrics wh ..."
Abstract

Cited by 236 (14 self)
 Add to MetaCart
The Border Gateway Protocol (BGP) is the de facto interdomain routing protocol used to exchange reachability information between Autonomous Systems in the global Internet. BGP is a pathvector protocol that allows each Autonomous System to override distancebased metrics with policybased metrics
Towards RequirementsDriven Information Systems Engineering: The Tropos Project
 INFORMATION SYSTEMS
, 2002
"... Information systems of the future will have to perform well within everchanging organizational environments. Unfortunately, existing software development methodologies (objectoriented, structured or otherwise) have traditionally been inspired by programming concepts, not organizational ones, leadi ..."
Abstract

Cited by 242 (48 self)
 Add to MetaCart
Information systems of the future will have to perform well within everchanging organizational environments. Unfortunately, existing software development methodologies (objectoriented, structured or otherwise) have traditionally been inspired by programming concepts, not organizational ones
Rotation invariant neural networkbased face detection
, 1998
"... In this paper, we present a neural networkbased face detection system. Unlike similar systems which are limited to detecting upright, frontal faces, this system detects faces at any degree of rotation in the image plane. The system employs multiple networks; a “router ” network first processes each ..."
Abstract

Cited by 215 (3 self)
 Add to MetaCart
In this paper, we present a neural networkbased face detection system. Unlike similar systems which are limited to detecting upright, frontal faces, this system detects faces at any degree of rotation in the image plane. The system employs multiple networks; a “router ” network first processes
On ellipsoidal techniques for reachability analysis. Part II. Internal Approximations Boxvalued constraints
, 2001
"... Following Part I, this article continues to describe the calculation of the reach sets and tubes for linear control systems with timevarying coefficients and ellipsoidal hard bounds on the controls and initial states. It deals with parametrized families of internal ellipsoidal approximations constr ..."
Abstract

Cited by 168 (8 self)
 Add to MetaCart
Following Part I, this article continues to describe the calculation of the reach sets and tubes for linear control systems with timevarying coefficients and ellipsoidal hard bounds on the controls and initial states. It deals with parametrized families of internal ellipsoidal approximations
Reachability Analysis of Dynamical Systems having PiecewiseConstant Derivatives
 Theoretical Computer Science
, 1995
"... In this paper we consider a class of hybrid systems, namely dynamical systems with piecewiseconstant derivatives (PCD systems). Such systems consist of a partition of the Euclidean space into a finite set of polyhedral sets (regions). Within each region the dynamics is defined by a constant vector ..."
Abstract

Cited by 129 (20 self)
 Add to MetaCart
field, hence discrete transitions occur only on the boundaries between regions where the trajectories change their direction. With respect to such systems we investigate the reachability question: Given an effective description of the systems and of two polyhedral subsets P and Q of the state
Reachability Analysis via Face Lifting
, 1998
"... . In this paper we discuss the problem of calculating the reachable states of a dynamical system defined by ordinary differential equations or inclusions. We present a prototype system for approximating this set and demonstrate some experimental results. 1 Introduction One of the main activities in ..."
Abstract

Cited by 91 (10 self)
 Add to MetaCart
in verifying a discrete system consists in finding the set of system states which are reachable, via the transition relation, from a given initial set of states (control synthesis for discreteevent systems [RW89] can ultimately be reduced to some variant of reachability analysis [AMP95b]). For small finite
Highdensity reachability analysis
 In ICCAD
, 1995
"... We address the problem of reachability analysis for large nite state systems. Symbolic techniques have revolutionized reachability analysis but still have limitations in traversing large systems. We present techniques to improve the symbolic breadthrst traversal and compute a lower bound on the r ..."
Abstract

Cited by 66 (7 self)
 Add to MetaCart
We address the problem of reachability analysis for large nite state systems. Symbolic techniques have revolutionized reachability analysis but still have limitations in traversing large systems. We present techniques to improve the symbolic breadthrst traversal and compute a lower bound
Evolving Mobile Robots in Simulated and Real Environments
 ARTIFICIAL LIFE
, 1996
"... The problem of the validity of simulation is particularly relevant for methodologies that use machine learning techniques to develop control systems for autonomous robots, like, for instance, the Artificial Life approach named Evolutionary Robotics. In fact, despite that it has been demonstrated ..."
Abstract

Cited by 206 (31 self)
 Add to MetaCart
demonstrated that training or evolving robots in the real environment is possible, the number of trials needed to test the system discourage the use of physical robots during the training period. By evolving neural controllers for a Khepera robot in computer simulations and then transferring the obtained
Linear ranking with reachability
 In CAV
, 2005
"... Abstract. We present a complete method for synthesizing lexicographic linear ranking functions supported by inductive linear invariants for loops with linear guards and transitions. Proving termination via linear ranking functions often requires invariants; yet invariant generation is expensive. Thu ..."
Abstract

Cited by 76 (10 self)
 Add to MetaCart
loops is necessary in many settings, suchas embedded systems and safety critical software. Additionally, proving general temporal properties of infinite state programs requires termination proofs, forwhich automatic methods are welcome [19, 11, 15]. We propose a termination analysis of linear loops
Results 11  20
of
7,034