001 |
|
97053 |
020 |
|
|a9783540639824 (paper)
|
050 |
|
|aQA76.76.V47|bB959 1997|cB959
|
082 |
04
|
|a515.24|221
|
809 |
|
|pEB|dQA76.76.V47|eB959|y1997
|
100 |
1
|
|aBurkart, Olaf.
|
245 |
10
|
|aAutomatic verification of sequential infinite-state processes|h[electronic resource] /|cOlaf Burkart.
|
260 |
|
|aBerlin ;|aNew York :|bSpringer,|cc1997.
|
300 |
|
|ax, 163 p. :|bdigital ;|c24 cm.
|
440 |
0
|
|aLecture notes in computer science,|x0302-9743 ;|v1354
|
650 |
0
|
|aBranch and bound algorithms.
|
650 |
0
|
|aProcesses, Infinite.
|
710 |
2
|
|aSpringerLink (Online service)
|
773 |
0
|
|tSpringer e-books
|
856 |
40
|
|uhttp://dx.doi.org/10.1007/3-540-69678-4
|
950 |
|
|aComputer Science (Lecture Notes in Computer Science)
|
856 |
40
|
|uhttp://dx.doi.org/10.1007/3-540-69678-4
|