Search Result Save to File Save as CSV
Your search for 38756 returns 2423 document(s)
Robust timed automata, (LNCS-Lecture Notes in Computer Science 1201) Hal 331-345
Author: Vineet Gupta; Thomas A. Henzinger; Radha Jagadeesan; | Call Number: 004.33 Mal h | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Comparing timed C/E systems with timed automata ( abstract ), (LNCS-Lecture Notes in Computer Science 1201) Hal 81-86
Author: R. Huuck; Y. Lakhnech; L. Urbina; S. Engell; S. Kowalewski; J. Preubig; | Call Number: 004.33 Mal h | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Verifying hybrid systems modeled as timed automata: a case study, (LNCS-Lecture Notes in Computer Science 1201) Hal 171-185
Author: Myla Archer; Constance heitmeyer; | Call Number: 004.33 Mal h | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Data-structures for the verification of timed automata, (LNCS-Lecture Notes in Computer Science 1201) Hal 346-360
Author: Eugene Asarin; Marius Bozga; Alain Kerbrat; Oded Maler; Amir Pnueli; Anne Rasse; | Call Number: 004.33 Mal h | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Robust timed automata, Hal. 331 - 345
Author: Vineet Gupta; Thomas A. Henzinger; Radha Jagadeesan; | Call Number: 004.33 Mal f | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Some progress in the symbolic verification of timed automata, (LNCS-Lecture Notes in Computer Science 1254) Hal 179-190
Author: Marius Bozga; Oded Maler; Amir Pnueli; Sergio Yovine; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Representation of robust and non-robust solutions of nonlinear discrete-continuous systems, (LNCS-Lecture Notes in Computer Science 1201) Hal 228-239
Author: Boris M. Miller; | Call Number: 004.33 Mal h | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
A new algorithm for discrete timed symbolic model checking, (LNCS-Lecture Notes in Computer Science 1201) Hal 18-32
Author: Jurgen Ruf; Thomas Kropf; | Call Number: 004.33 Mal h | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
A case study in timed CSP: The railroad crossing problem, (LNCS-Lecture Notes in Computer Science 1201) Hal 69-74
Author: Luming Lai; Phil Watson; | Call Number: 004.33 Mal h | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Analysis of slope-parametric hybrid automata, (LNCS-Lecture Notes in Computer Science 1201) Hal 75-80
Author: Frederic Boniol; Augusto Burgueno; Olivier Roux; Vlad Rusu; | Call Number: 004.33 Mal h | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Prev   1 2 3 4 5 6 7 8 9 10  Next