Online minimization of transition systems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Theoretical Computer Science
Communication and Concurrency
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Approximate bisimulation relations for constrained linear systems
Automatica (Journal of IFAC)
Approximate Simulation Relations for Hybrid Systems
Discrete Event Dynamic Systems
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Approximately Bisimilar Symbolic Models for Incrementally Stable Switched Systems
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Verifying Tolerant Systems Using Polynomial Approximations
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
On the expressiveness and decidability of o-minimal hybrid systems
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
On bicontinuous bisimulation and the preservation of stability
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Counter-example guided predicate abstraction of hybrid systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Robustness of temporal logic specifications
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
Abstraction based model-checking of stability of hybrid systems
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Pre-orders for reasoning about stability properties with respect to input of hybrid systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
Pre-orders between processes, like simulation, have played a central role in the verification and analysis of discrete-state systems. Logical characterization of such pre-orders have allowed one to verify the correctness of a system by analyzing an abstraction of the system. In this paper, we investigate whether this approach can be feasibly applied to reason about stability properties of a system. Stability is an important property of systems that have a continuous component in their state space; it stipulates that when a system is started somewhere close to its ideal starting state, its behavior is close to its ideal, desired behavior. In [Cuijpers 07], it was shown that stability with respect to equilibrium states is not preserved by bisimulation and hence additional continuity constraints were imposed on the bisimulation relation to ensure preservation of Lyapunov stability. We first show that stability of trajectories is not invariant even under the notion of bisimulation with continuity conditions introduced in [Cuijpers 07]. We then present the notion of uniformly continuous simulations --- namely, simulation with some additional uniform continuity conditions on the relation --- that can be used to reason about stability of trajectories. Finally, we show that uniformly continuous simulations are widely prevalent, by recasting many classical results on proving stability of dynamical and hybrid systems as establishing the existence of a simple, obviously stable system that simulates the desired system through uniformly continuous simulations.