Počet záznamů: 1
Constraints for Continuous Reachability in the Verification of Hybrid Systems
- 1.Ratschan, Stefan - She, Z.
Constraints for Continuous Reachability in the Verification of Hybrid Systems.
Artificial Intelligence and Symbolic Computation. Berlin: Springer, 2006 - (Calmet, J.; Ida, T.; Wang, D.), s. 196-210. Lecture Notes in Artificial Intelligence, 4120. ISBN 3-540-39728-0.
[AISC 2006. International Conference on Artificial Intelligence and Symbolic Computation /8./. Beijing (CN), 20.09.2006-22.09.2006]
http://hdl.handle.net/11104/0183323
Citováno: 5
--- JHA, S. - BRADY, B.A. - SESHIA, S.A. Symbolic reachability analysis of lazy linear hybrid automata. Formal Modeling and Analysis of Timed Systems. ISSN 0302-9743, 2007, vol. 4763, p. 241-256. [WOS]
--- YAN, C. - OUCHET, F. - FESQUET, L. - MORIN-ALLORY, K. Formal Verification of C-element Circuits. 17TH IEEE INTERNATIONAL SYMPOSIUM ON ASYNCHRONOUS CIRCUITS AND SYSTEMS (ASYNC 2011). ISSN 1522-8681, 2011, p. 55-64. [WOS]
--- KOROVINA, M. - KUDINOV, O. Sigma(K)-constraints for Hybrid Systems. PERSPECTIVES OF SYSTEMS INFORMATICS. ISSN 0302-9743, 2010, vol. 5947, p. 230-241. [WOS]
--- KOROVINA, M. - KUDINOV, O. Index Sets as a Measure of Continuous Constraint Complexity. PERSPECTIVES OF SYSTEM INFORMATICS, PSI 2014. ISSN 0302-9743, 2015, vol. 8974, p. 201-215. [WOS]
--- YANG, Z.F. - LIN, W. - WU, M. Exact Safety Verification of Hybrid Systems Based on Bilinear SOS Representation. ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS. ISSN 1539-9087, JAN 2015, vol. 14, no. 1. [WOS]
Počet záznamů: 1