Reachability analysis using proximity based automata

Date

2004-01-01

Author

Kapinski, Jim
Schmidt, Klaus Verner
Krogh, Bruce

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

142
views

0
downloads

This paper introduces proximity based automata (PBA) to perform reachability analysis for discrete-time, continuous-state systems. The notion of proximity of states in the continuous valued state space is used to evaluate the response of the system efficiently. A PBA is constructed using ellipsoidal techniques and tools for solving optimization problems constrained by linear matrix inequalities. Several empirical studies demonstrate how trade-offs between conservativeness and computational complexity can be exploited by varying parameters in the procedure for constructing the PBA.

Subject Keywords

Reachability, Hybrid systems, Verification, Dynamic systems

URI

https://hdl.handle.net/11511/35499

DOI

https://doi.org/10.1016/s1474-6670(17)30765-6

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Robot end-effector based sensor integration for tracking moving parts Konukseven, Erhan İlhan (2000-08-31) This paper presents a cost-efficient end-effector based infrared proximity sensor integration system and the implementation of fuzzy-logic control algorithm.
Concurrency control for distributed multiversion databases through time intervals Halıcı, Uğur (1991-04-01) © 1991 ACM.Multiversion Schedulers are now a widely accepted method for enhancing performance of the concurrency control component of a database. When the read and write sets of transactions are known in advance, the amount of concurrency provided by the Multiversion Schedulers can further be improved. In this paper, a new concurrency control technique, which uses multiversion data in conjunction with predeclared read-write sets and the Time Interval technique is suggested. With the proposed method, a trans...
Hierarchical multitasking control of discrete event systems: Computation of projections and maximal permissiveness Schmidt, Klaus Verner; Cury, José E.r. (null; 2010-12-01) This paper extends previous results on the hierarchical and decentralized control of multitasking discrete event systems (MTDES). Colored observers, a generalization of the observer property, together with local control consistency, allow to derive sufficient conditions for synthesizing modular and hierarchical control that are both strongly nonblocking (SNB) and maximally permissive. A polynomial procedure to verify if a projection fulfills the above properties is proposed and in the case they fail for a g...
Neural identification of dynamic systems on FPGA with improved PSO learning Cavuslu, Mehmet Ali; KARAKUZU, CİHAN; KARAKAYA, FUAT (2012-09-01) This work introduces hardware implementation of artificial neural networks (ANNs) with learning ability on field programmable gate array (FPGA) for dynamic system identification. The learning phase is accomplished by using the improved particle swarm optimization (PSO). The improved PSO is obtained by modifying the velocity update function. Adding an extra term to the velocity update function reduced the possibility of stucking in a local minimum. The results indicates that ANN, trained using improved PSO a...
Representing temporal knowledge in connectionist expert systems Alpaslan, Ferda Nur (1996-09-27) This paper introduces a new temporal neural networks model which can be used in connectionist expert systems. Also, a Variation of backpropagation algorithm, called the temporal feedforward backpropagation algorithm is introduced as a method for training the neural network. The algorithm was tested using training examples extracted from a medical expert system. A series of experiments were carried out using the temporal model and the temporal backpropagation algorithm. The experiments indicated that the alg...

Citation Formats

J. Kapinski, K. V. Schmidt, and B. Krogh, “Reachability analysis using proximity based automata,” 2004, vol. 37, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35499.