Search Result Save to File Save as CSV
Your search for 38730 returns 3034 document(s)
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 
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 
The railroad crossing problem modeling with hybrid argos-analysis with polka, Hal. 265-271
Author: Nicolas Halbwachs, Florence Maranichi and Yann-Eric Proy; | Call Number: SEM-253 | Type: Indeks Artikel prosiding/Sem
Find Similar |  Add To Favorites |  Detail in New Window 
Safety verification for automated platoon maneuvers: a case study, (LNCS-Lecture Notes in Computer Science 1201) Hal 154-170
Author: Ekaterina Dolginova; Nancy Lynch; | 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 
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 
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 
STARI: a case study in compositional and hierarchial timing verification, (LNCS-Lecture Notes in Computer Science 1254) Hal 191-201
Author: Serdar Tasiran; Robert K. Brayton; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
Find Similar |  Add To Favorites |  Detail in New Window 
A concurrency case study using RAISE, (LNCS-Lecture Notes in Computer Science 670) Hal 367-387
Author: Anne Haxthausen; Chris George; | Call Number: 004 Woo f | 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