Search Result Save to File Save as CSV
Your search for 39695 returns 4038 document(s)
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 
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 
Using compositional preorders in the verification of sliding window protocol, (LNCS-Lecture Notes in Computer Science 1254) Hal 48-59
Author: Roope Kaivola; | 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 
From duration calculus to linear hybrid automata (extended abstract), (LNCS-Lecture Notes in Computer Science 939) Hal 196-210
Author: Ahmed Bouajjani; Yassine Lakhnech; Riadh Robbana; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Compositional verification of synchronous networks, (LNCS-Lecture Notes in Computer Science 1926) Hal 214-227
Author: Leszek Holenderski; | Call Number: 004.33 Jos f | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Using cylindrical algebraic decomposition for the analysis of slope parametric hybrid automata, (LNCS-Lecture Notes in Computer Science 1926) Hal 252-263
Author: Michael Adlaide; Olivier Roux; | Call Number: 004.33 Jos f | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Hardware verification using monadic second-order logic, (LNCS-Lecture Notes in Computer Science 939) Hal 31-41
Author: David A. Basin; Nils Klarlund; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
Trace theoretic verification of asynchronous circuits using unfoldings, (LNCS-Lecture Notes in Computer Science 939) Hal 180-195
Author: K. L. McMillan; | 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