Search Result Save to File Save as CSV
Your search for 38821 returns 2478 document(s)
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 
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, (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 
Parametrized verification of linear networks using automata as invariants, (LNCS-Lecture Notes in Computer Science 1254) Hal 412-423
Author: A. Prasad Sistla; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Parametrized verification of linear networks using automata as invariants, (LNCS-Lecture Notes in Computer Science 1254)Hal. 412-423
Author: A. Prasad Sistia; | Call Number: 004 Int c | 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 
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 
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 
Formal verification for fault-tolerant architectures: some lessons learned, (LNCS-Lecture Notes in Computer Science 670) Hal 482-500
Author: Sam Owre; John Rushby; Natarajan Shankar; Friedrich von Henke; | Call Number: 004 Woo f | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Some thoughts on statecharts, 13 years later, (LNCS-Lecture Notes in Computer Science 1254) Hal 226-231
Author: David Harel; | Call Number: 004 Int c | 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