Your search for 38822 returns 2892 document(s) |
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
|
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
|
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
|
Formal verification - applications & case studies, (LNCS-Lecture Notes in Computer Science 1254) Hal 11 |
Author: Martin Rowe; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Using formal verification/analysis methods on the critical path in system design: a case study, (LNCS-Lecture Notes in Computer Science 939) Hal 367-380 |
Author: Asgeir Th. Eiriksson; Ken L. McMillan; | 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
|
Containment of regular languages in non-regular timing diagram languages is decidable, (LNCS-Lecture Notes in Computer Science 1254) Hal 155-166 |
Author: Kathi Fisler; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
A compositional rule for hardware design refinement, (LNCS-Lecture Notes in Computer Science 1254) Hal 24-35 |
Author: K. L. McMillan; | Call Number: 004 Int c | 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
|
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
|