-
1
-
-
0029637354
-
The algorithmic analysis of hybrid systems
-
R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138(1):3-34, 1995.
-
(1995)
Theoretical Computer Science
, vol.138
, Issue.1
, pp. 3-34
-
-
Alur, R.1
Courcoubetis, C.2
Halbwachs, N.3
Henzinger, T.A.4
Ho, P.-H.5
Nicollin, X.6
Olivero, A.7
Sifakis, J.8
Yovine, S.9
-
4
-
-
33846672502
-
Hybridization methods for the analysis of nonlinear systems
-
E. Asarin, T. Dang, and A. Girard. Hybridization methods for the analysis of nonlinear systems. Acta Informatica, 43(7):451-476, 2007.
-
(2007)
Acta Informatica
, vol.43
, Issue.7
, pp. 451-476
-
-
Asarin, E.1
Dang, T.2
Girard, A.3
-
5
-
-
0035441462
-
Verification of infinite-state dynamic systems using approximate quotient transition systems
-
DOI 10.1109/9.948467, PII S0018928601088018
-
A. Chutinan and B.H. Krogh. Infinite state transition system verification using approximate quotient transition systems. IEEE Transactions on Automatic Control, 46:1401-1410, 2001. (Pubitemid 32981643)
-
(2001)
IEEE Transactions on Automatic Control
, vol.46
, Issue.9
, pp. 1401-1410
-
-
Chutinan, A.1
Krogh, B.H.2
-
7
-
-
3042559983
-
Abstraction and counterexample-guided refinement in model checking of hybrid systems
-
E.M. Clarke, A. Fehnker, Z. Han, B. Krogh, J. Ouaknine, O. Stursberg, and M. Theobald. Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems. International Journal on Foundations of Computer Science, 14(4):583-604, 2003.
-
(2003)
International Journal on Foundations of Computer Science
, vol.14
, Issue.4
, pp. 583-604
-
-
Clarke, E.M.1
Fehnker, A.2
Han, Z.3
Krogh, B.4
Ouaknine, J.5
Stursberg, O.6
Theobald, M.7
-
8
-
-
35248899265
-
Verification of hybrid systems based on counterexmple-guided abstraction refinement
-
E.M. Clarke, A. Fehnker, Z. Han, B. Krogh, J. Ouaknine, O. Stursberg, and M. Theobald. Verification of Hybrid Systems Based on Counterexmple-Guided Abstraction Refinement. In Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pages 192-207, 2003.
-
(2003)
Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems
, pp. 192-207
-
-
Clarke, E.M.1
Fehnker, A.2
Han, Z.3
Krogh, B.4
Ouaknine, J.5
Stursberg, O.6
Theobald, M.7
-
9
-
-
84957870468
-
Reachability Analysis via Face Lifting
-
Hybrid Systems: Computation and Control
-
T. Dang and O. Maler. Reachability analysis via face lifting. In Proceedings of the International Conference on Hybrid Systems: Computation and Control, pages 96-109, 1998. (Pubitemid 128055511)
-
(1998)
Lecture Notes in Computer Science
, Issue.1386
, pp. 96-109
-
-
Dang, T.1
Maler, O.2
-
11
-
-
24344473055
-
Refining abstractions of hybrid systems using counterexample fragments
-
Hybrid Systems: Computation and Control - 8th International Workshop, HSCC 2005
-
A. Fehnker, E.M. Clarke, S. Jha, and B. Krogh. Refining Abstractions of Hybrid Systems using Counterexample Fragments. In Proceedings of the International Conference on Hybrid Systems: Computation and Control, pages 242-257, 2005. (Pubitemid 41252071)
-
(2005)
Lecture Notes in Computer Science
, vol.3414
, pp. 242-257
-
-
Fehnker, A.1
Clarke, E.2
Jha, S.K.3
Krogh, B.4
-
13
-
-
24344472268
-
Reachability of uncertain linear systems using zonotopes
-
Hybrid Systems: Computation and Control - 8th International Workshop, HSCC 2005
-
A. Girard. Reachability of uncertain linear systems using zonotopes. In Proceedings of the International Conference on Hybrid Systems: Computation and Control, pages 291-305, 2005. (Pubitemid 41252074)
-
(2005)
Lecture Notes in Computer Science
, vol.3414
, pp. 291-305
-
-
Girard, A.1
-
16
-
-
0001954045
-
What's decidable about hybrid automata?
-
T.A. Henzinger, P.W. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata? In Proceedings of the ACM Symposium on Theory of Computation, pages 373-382, 1995.
-
(1995)
Proceedings of the ACM Symposium on Theory of Computation
, pp. 373-382
-
-
Henzinger, T.A.1
Kopke, P.W.2
Puri, A.3
Varaiya, P.4
-
17
-
-
38049133050
-
Reachability for linear hybrid automata using iterative relaxation abstraction
-
S.K. Jha, B.H. Krogh, J.E. Weimer, and E.M. Clarke. Reachability for linear hybrid automata using iterative relaxation abstraction. In Proceedings of the International Conference on Hybrid Systems: Computation and Control, pages 287-300, 2007.
-
(2007)
Proceedings of the International Conference on Hybrid Systems: Computation and Control
, pp. 287-300
-
-
Jha, S.K.1
Krogh, B.H.2
Weimer, J.E.3
Clarke, E.M.4
-
19
-
-
0033906082
-
O-minimal hybrid systems
-
G. Lafferriere, G.J. Pappas, and S. Sastry. O-minimal Hybrid Systems. Mathematics of Control, Signals, and Systems, 13(1):1-21, 2000. (Pubitemid 30578622)
-
(2000)
Mathematics of Control, Signals, and Systems
, vol.13
, Issue.1
, pp. 1-21
-
-
Lafferriere, G.1
Pappas, G.J.2
Sastry, S.3
-
22
-
-
33646196701
-
Algorithmic algebraic model checking II: Decidability of semi-algebraic model checking and its applications to systems biology
-
Venkatesh Mysore, Carla Piazza, and Bud Mishra. Algorithmic Algebraic Model Checking II: Decidability of Semi-algebraic Model Checking and Its Applications to Systems Biology. In atva, pages 217-233, 2005.
-
(2005)
Atva
, pp. 217-233
-
-
Mysore, V.1
Piazza, C.2
Mishra, B.3
-
23
-
-
26444525313
-
Algorithmic algebraic model checking I: Challenges from systems biology
-
Computer Aided Verification: 17th International Conference, CAV 2005. Proceedings
-
Carla Piazza, Marco Antoniotti, Venkatesh Mysore, Alberto Policriti, Franz Winkler, and Bud Mishra. Algorithmic Algebraic Model Checking I: Challenges from Systems Biology. In Proceedings of the International Conference on Computer Aided Verification, pages 5-19, 2005. (Pubitemid 41431716)
-
(2005)
Lecture Notes in Computer Science
, vol.3576
, pp. 5-19
-
-
Piazza, C.1
Antoniotti, M.2
Mysore, V.3
Policriti, A.4
Winkler, F.5
Mishra, B.6
-
24
-
-
77649326306
-
Verifying tolerant systems using polynomial approximations
-
P. Prabhakar, V. Vladimerou, M. Viswanathan, and G.E. Dullerud. Verifying tolerant systems using polynomial approximations. In Proceedings of the IEEE Real-Time Systems Symposium, pages 181-190, 2009.
-
(2009)
Proceedings of the IEEE Real-Time Systems Symposium
, pp. 181-190
-
-
Prabhakar, P.1
Vladimerou, V.2
Viswanathan, M.3
Dullerud, G.E.4
-
26
-
-
38149096866
-
Abstraction and counterexample-guided construction of omega-automata for model checking of step-discrete linear hybrid models
-
M. Segelken. Abstraction and Counterexample-guided Construction of Omega-Automata for Model Checking of Step-discrete linear Hybrid Models. In Proceedings of the International Conference on Computer Aided Verification, pages 433-448, 2007.
-
(2007)
Proceedings of the International Conference on Computer Aided Verification
, pp. 433-448
-
-
Segelken, M.1
-
27
-
-
49049107553
-
STORMED hybrid systems
-
V. Vladimerou, P. Prabhakar, M. Viswanathan, and G.E. Dullerud. STORMED hybrid systems. In Proceedings of the International Colloquium on Automata, Languages and Programming, pages 136-147, 2008.
-
(2008)
Proceedings of the International Colloquium on Automata, Languages and Programming
, pp. 136-147
-
-
Vladimerou, V.1
Prabhakar, P.2
Viswanathan, M.3
Dullerud, G.E.4
|