Proceedings of the 1999 IEEE International Symposium on Computer Aided Control System Design (Cat. No.99TH8404), 2000
The decomposition of a system into modular components, together with abstractions of the componen... more The decomposition of a system into modular components, together with abstractions of the components, can allow a computationally difficult global verification task to be broken into a number of smaller, more manageable verification subtasks. We provide the first known nontrivial application of modular verification in conjunction with the model-checking paradigm for verifying hybrid systems. We verify a fault-tolerant active structure
. Rectangular automata are well suited for approximate modelingof continuous--discrete systems. T... more . Rectangular automata are well suited for approximate modelingof continuous--discrete systems. The exact analysis of these automatais feasible for small examples but can encounter severe numericalproblems for even medium-sized systems. This paper presents an analysisalgorithm that uses conservative overapproximation to avoid these numericalproblems. The algorithm is demonstrated on a simple benchmarksystem consisting of two connected tanks.1 IntroductionEmbedded systems consist of...
Proceedings of the 36th IEEE Conference on Decision and Control, 2000
A hybrid system is a dynamical system whose behavior exhibits both discrete and continuous change... more A hybrid system is a dynamical system whose behavior exhibits both discrete and continuous change. A hybrid automaton is a mathematical model for hybrid systems, which combines, in a single formalism, automaton transitions for capturing discrete change with differential equations for capturing continuous change. In this survey, we demonstrate symbolic algorithms for the verification of and controller synthesis for linear
Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228), 2000
... since the parameter n may be much larger than s. This behavior led to a non-terminating reach... more ... since the parameter n may be much larger than s. This behavior led to a non-terminating reach-ability analysis. ... state space by approximating its dy-namics can lead to an outwardly spiraling set of reachable states. ... Reachability analysis of (timed) Petri nets using real arithmetic. ...
... how this automaton is derived from that of Figure 4 by dropping all predicates that restrict ... more ... how this automaton is derived from that of Figure 4 by dropping all predicates that restrict ... If the designer is free to choose values for the threshold parameters L', L, U ... explained in Subsection 2.5, the conditions are necessary and sufficient for the approximating linear system, but ...
... In the context of hybrid systems analysis, the loss of precision caused by the accumulation o... more ... In the context of hybrid systems analysis, the loss of precision caused by the accumulation of round-off errors in the numerical integration process may lead the ... Thus, if an unsafe (target) state of a hybrid automaton is reachable, HyperTech is guaranteed to note its reachability. ...
Model checking is a powerful technique for the automatic verification of finite-state systems [10... more Model checking is a powerful technique for the automatic verification of finite-state systems [10, 13, 8]. A model-checking algorithm determines whether a finite-state system, represented by its 'state-transition graph, satisfies its specification given as a temporM logic formula. For speed independent or delay insensitive systems, the correctness can be proved by abstracting away real-time retMning only the sequencing of state-transitions. For such systems, model checking has a long history spanning over ten years, and has been shown to be useful in validating ...
Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334), 2000
Abstract The specification for the idle control problem for automotive engines is to maintain the... more Abstract The specification for the idle control problem for automotive engines is to maintain the crankshaft speed within a given range in the presence of load changes. A cycle-detailed hybrid model of the engine that captures well the interactions between the discrete phenomena of torque generation and spark ignition, and the continuous evolution of the power-train and air dynamics, is proposed. The maximal robust-controlled invariant set that satisfies the specification is determined and the maximal controller for the engine in idle is ...
Abstract. A hybrid system is a dynamical system whose behavior exhibits both discrete and continu... more Abstract. A hybrid system is a dynamical system whose behavior exhibits both discrete and continuous change. A hybrid automaton is a mathematical model for hy-brid systems, which combines, in a single formalism, au-tomaton transitions for capturing discrete change with differential ...
Page 1. The Expressive Power of Clocks* Thomas A. Henzinger, Peter W. Kopke, and HowardWong-Toi C... more Page 1. The Expressive Power of Clocks* Thomas A. Henzinger, Peter W. Kopke, and HowardWong-Toi Computer Science Department, Cornell University, Ithaca, NY 14853 Abstract. We investigate the expressive power of timing restrictions on labeled transition systems. ...
... The synthesis procedure starts from the automaton A, and is summarized as follows: 1. introdu... more ... The synthesis procedure starts from the automaton A, and is summarized as follows: 1. introducing a syntactic constant ~ for the clock drift, yielding A(r 2. transforming A(e) into A'(~), by moving the ... Verification of an audio-control protocol. ... Delay analysis in synchronous programs ...
Page 1. Linear Phase-Portrait Approximations for Nonlinear Hybrid Systems* Thomas A. Henzinger an... more Page 1. Linear Phase-Portrait Approximations for Nonlinear Hybrid Systems* Thomas A. Henzinger and Howard Wong-Toi Department of Computer Science, Cornell University, Ithaca, NY 14853 Abstract. We use linear hybrid ...
Ramadge and Wonham [1] gave algorithms for finding controllers in their supervisory control frame... more Ramadge and Wonham [1] gave algorithms for finding controllers in their supervisory control framework. Their automatic synthesis techniques are implemented here using binary decision diagrams [2]. This technique of symbolic representation capitalizes on loose coupling between controlled plant components. We are able to synthesize a controller for a wafer-manufacturing plant, for which an explicit representation would have about 106 states.
Systems involving interaction among state machines, such as protocols, concurrent algorithms, and... more Systems involving interaction among state machines, such as protocols, concurrent algorithms, and certain kinds of haxdwarc, often contain subtle design errors that defy detection by conventional means, such as inspection, simulation, and testing a prototype. As a result, formal verification methods for such systems axe of increasing interest. We are interested in a.utoma.tic verification using finite-state models of systems, with the underlying assumption that system behavior can be represented as a set of sequences representing all the possible ...
Proceedings of the 1999 IEEE International Symposium on Computer Aided Control System Design (Cat. No.99TH8404), 2000
The decomposition of a system into modular components, together with abstractions of the componen... more The decomposition of a system into modular components, together with abstractions of the components, can allow a computationally difficult global verification task to be broken into a number of smaller, more manageable verification subtasks. We provide the first known nontrivial application of modular verification in conjunction with the model-checking paradigm for verifying hybrid systems. We verify a fault-tolerant active structure
. Rectangular automata are well suited for approximate modelingof continuous--discrete systems. T... more . Rectangular automata are well suited for approximate modelingof continuous--discrete systems. The exact analysis of these automatais feasible for small examples but can encounter severe numericalproblems for even medium-sized systems. This paper presents an analysisalgorithm that uses conservative overapproximation to avoid these numericalproblems. The algorithm is demonstrated on a simple benchmarksystem consisting of two connected tanks.1 IntroductionEmbedded systems consist of...
Proceedings of the 36th IEEE Conference on Decision and Control, 2000
A hybrid system is a dynamical system whose behavior exhibits both discrete and continuous change... more A hybrid system is a dynamical system whose behavior exhibits both discrete and continuous change. A hybrid automaton is a mathematical model for hybrid systems, which combines, in a single formalism, automaton transitions for capturing discrete change with differential equations for capturing continuous change. In this survey, we demonstrate symbolic algorithms for the verification of and controller synthesis for linear
Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228), 2000
... since the parameter n may be much larger than s. This behavior led to a non-terminating reach... more ... since the parameter n may be much larger than s. This behavior led to a non-terminating reach-ability analysis. ... state space by approximating its dy-namics can lead to an outwardly spiraling set of reachable states. ... Reachability analysis of (timed) Petri nets using real arithmetic. ...
... how this automaton is derived from that of Figure 4 by dropping all predicates that restrict ... more ... how this automaton is derived from that of Figure 4 by dropping all predicates that restrict ... If the designer is free to choose values for the threshold parameters L', L, U ... explained in Subsection 2.5, the conditions are necessary and sufficient for the approximating linear system, but ...
... In the context of hybrid systems analysis, the loss of precision caused by the accumulation o... more ... In the context of hybrid systems analysis, the loss of precision caused by the accumulation of round-off errors in the numerical integration process may lead the ... Thus, if an unsafe (target) state of a hybrid automaton is reachable, HyperTech is guaranteed to note its reachability. ...
Model checking is a powerful technique for the automatic verification of finite-state systems [10... more Model checking is a powerful technique for the automatic verification of finite-state systems [10, 13, 8]. A model-checking algorithm determines whether a finite-state system, represented by its 'state-transition graph, satisfies its specification given as a temporM logic formula. For speed independent or delay insensitive systems, the correctness can be proved by abstracting away real-time retMning only the sequencing of state-transitions. For such systems, model checking has a long history spanning over ten years, and has been shown to be useful in validating ...
Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334), 2000
Abstract The specification for the idle control problem for automotive engines is to maintain the... more Abstract The specification for the idle control problem for automotive engines is to maintain the crankshaft speed within a given range in the presence of load changes. A cycle-detailed hybrid model of the engine that captures well the interactions between the discrete phenomena of torque generation and spark ignition, and the continuous evolution of the power-train and air dynamics, is proposed. The maximal robust-controlled invariant set that satisfies the specification is determined and the maximal controller for the engine in idle is ...
Abstract. A hybrid system is a dynamical system whose behavior exhibits both discrete and continu... more Abstract. A hybrid system is a dynamical system whose behavior exhibits both discrete and continuous change. A hybrid automaton is a mathematical model for hy-brid systems, which combines, in a single formalism, au-tomaton transitions for capturing discrete change with differential ...
Page 1. The Expressive Power of Clocks* Thomas A. Henzinger, Peter W. Kopke, and HowardWong-Toi C... more Page 1. The Expressive Power of Clocks* Thomas A. Henzinger, Peter W. Kopke, and HowardWong-Toi Computer Science Department, Cornell University, Ithaca, NY 14853 Abstract. We investigate the expressive power of timing restrictions on labeled transition systems. ...
... The synthesis procedure starts from the automaton A, and is summarized as follows: 1. introdu... more ... The synthesis procedure starts from the automaton A, and is summarized as follows: 1. introducing a syntactic constant ~ for the clock drift, yielding A(r 2. transforming A(e) into A'(~), by moving the ... Verification of an audio-control protocol. ... Delay analysis in synchronous programs ...
Page 1. Linear Phase-Portrait Approximations for Nonlinear Hybrid Systems* Thomas A. Henzinger an... more Page 1. Linear Phase-Portrait Approximations for Nonlinear Hybrid Systems* Thomas A. Henzinger and Howard Wong-Toi Department of Computer Science, Cornell University, Ithaca, NY 14853 Abstract. We use linear hybrid ...
Ramadge and Wonham [1] gave algorithms for finding controllers in their supervisory control frame... more Ramadge and Wonham [1] gave algorithms for finding controllers in their supervisory control framework. Their automatic synthesis techniques are implemented here using binary decision diagrams [2]. This technique of symbolic representation capitalizes on loose coupling between controlled plant components. We are able to synthesize a controller for a wafer-manufacturing plant, for which an explicit representation would have about 106 states.
Systems involving interaction among state machines, such as protocols, concurrent algorithms, and... more Systems involving interaction among state machines, such as protocols, concurrent algorithms, and certain kinds of haxdwarc, often contain subtle design errors that defy detection by conventional means, such as inspection, simulation, and testing a prototype. As a result, formal verification methods for such systems axe of increasing interest. We are interested in a.utoma.tic verification using finite-state models of systems, with the underlying assumption that system behavior can be represented as a set of sequences representing all the possible ...
Uploads