|
|
|
|
LEADER |
05066nam a22005775i 4500 |
001 |
978-3-540-33171-1 |
003 |
DE-He213 |
005 |
20151204142503.0 |
007 |
cr nn 008mamaa |
008 |
100301s2006 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540331711
|9 978-3-540-33171-1
|
024 |
7 |
|
|a 10.1007/11730637
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA75.5-76.95
|
072 |
|
7 |
|a UY
|2 bicssc
|
072 |
|
7 |
|a UYA
|2 bicssc
|
072 |
|
7 |
|a COM014000
|2 bisacsh
|
072 |
|
7 |
|a COM031000
|2 bisacsh
|
082 |
0 |
4 |
|a 004.0151
|2 23
|
245 |
1 |
0 |
|a Hybrid Systems: Computation and Control
|h [electronic resource] :
|b 9th International Workshop, HSCC 2006, Santa Barbara, CA, USA, March 29-31, 2006. Proceedings /
|c edited by João P. Hespanha, Ashish Tiwari.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2006.
|
300 |
|
|
|a XII, 584 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3927
|
505 |
0 |
|
|a Invited Talks -- Motion Coordination for Multi-agent Networks -- Towards a Third Generation of Control Systems -- Hybrid Systems—And Everything Else -- Regular Papers -- Behavioural Approximations for Restricted Linear Differential Hybrid Automata -- Bounded Model Checking for GSMP Models of Stochastic Real-Time Systems -- On the Stability of Zeno Equilibria -- Reachability Analysis for Controlled Discrete Time Stochastic Hybrid Systems -- Output-Based Optimal Timing Control of Switched Systems -- Hybrid Modelling and Control of the Common Rail Injection System -- Event-Based Model Predictive Control and Verification of Integral Continuous-Time Hybrid Automata -- Improving Efficiency of Finite Plans by Optimal Choice of Input Sets -- Optimality Zone Algorithms for Hybrid Systems: Efficient Algorithms for Optimal Location and Control Computation -- Approximate Reachability Computation for Polynomial Systems -- A Lattice Theory for Solving Games of Imperfect Information -- Observability of Hybrid Automata by Abstraction -- Reconstruction of Switching Thresholds in Piecewise-Affine Models of Genetic Regulatory Networks -- Decision Problems for the Verification of Real-Time Software -- Laplacian Sheep: A Hybrid, Stop-Go Policy for Leader-Based Containment Control -- Optimal Control of Piece-Wise Polynomial Hybrid Systems Using Cylindrical Algebraic Decomposition -- The Reachability Problem for Uncertain Hybrid Systems Revisited: A Viability Theory Perspective -- Efficient Computation of Reachable Sets of Linear Time-Invariant Systems with Inputs -- Verification Using Simulation -- Reachability Analysis of Large-Scale Affine Systems Using Low-Dimensional Polytopes -- Simultaneous Optimization of Continuous Control Inputs and Discrete State Waypoints -- Approximate Abstraction of Stochastic Hybrid Automata -- A Fully Automated Framework for Control of Linear Systems from LTL Specifications -- Reachability Analysis of Multi-affine Systems -- Approximation, Sampling and Voting in Hybrid Computing Systems -- Computational Methods for Reachability Analysis of Stochastic Hybrid Systems -- R-Charon, a Modeling Language for Reconfigurable Hybrid Systems -- Estimation and Conflict Detection in Human Controlled Systems -- Stability Analysis of Hybrid Systems Via Small-Gain Theorems -- Stochastic Hybrid Delay Population Dynamics -- Finite Gain l p Stabilization Is Impossible by Bit-Rate Constrained Feedback -- Specification and Analysis of Distributed Object-Based Stochastic Hybrid Systems -- Verifying Average Dwell Time by Solving Optimization Problems -- Interchange Format for Hybrid Systems: Abstract Semantics -- Model Checking of Hybrid Systems: From Reachability Towards Stability -- A Feedback Control Motivation for Generalized Solutions to Hybrid Systems -- Fixed Point Iteration for Computing the Time Elapse Operator -- Mixed Initial-Boundary Value Problems for Scalar Conservation Laws: Application to the Modeling of Transportation Networks -- Beyond Zeno: Get on with It!.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Microprocessors.
|
650 |
|
0 |
|a Special purpose computers.
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Computer logic.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Theory of Computation.
|
650 |
2 |
4 |
|a Special Purpose and Application-Based Systems.
|
650 |
2 |
4 |
|a Processor Architectures.
|
650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
650 |
2 |
4 |
|a Software Engineering.
|
650 |
2 |
4 |
|a Computation by Abstract Devices.
|
700 |
1 |
|
|a Hespanha, João P.
|e editor.
|
700 |
1 |
|
|a Tiwari, Ashish.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540331704
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3927
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/11730637
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (Springer-11645)
|