| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Abstraction of parameterized networks
|
Lesens, David
|
|
1997
|
9 |
C |
p. 42-
1 p.
|
artikel
|
| 2 |
A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract)
|
Finkel, Alain
|
|
1997
|
9 |
C |
p. 27-37
11 p.
|
artikel
|
| 3 |
Bisimilarity of processes with finite-state systems
|
Jancar, Petr
|
|
1997
|
9 |
C |
p. 41-
1 p.
|
artikel
|
| 4 |
Cyclic Petri Net Reachability Sets are Semi-linear Effectively Constructible
|
Bouziane, Zakaria
|
|
1997
|
9 |
C |
p. 15-24
10 p.
|
artikel
|
| 5 |
Decidability of strong bisimulation of basic parallel processes using Hilbert's basis theorem
|
Stríbrná, Jitka
|
|
1997
|
9 |
C |
p. 44-
1 p.
|
artikel
|
| 6 |
L(A) = L(B)?
|
Sénizergues, Géraud
|
|
1997
|
9 |
C |
p. 43-
1 p.
|
artikel
|
| 7 |
Model checking rationally restricted right closures of recognizable graphs
|
Burkart, Olaf
|
|
1997
|
9 |
C |
p. 25-
1 p.
|
artikel
|
| 8 |
Preface
|
Moller, Faron
|
|
1997
|
9 |
C |
p. 1-
1 p.
|
artikel
|
| 9 |
Reachability sets of parameterized rings as regular languages
|
Fribourg, Laurent
|
|
1997
|
9 |
C |
p. 40-
1 p.
|
artikel
|
| 10 |
The bounded retransmission protocol revisited
|
Dams, Dennis
|
|
1997
|
9 |
C |
p. 26-
1 p.
|
artikel
|
| 11 |
Verifying Invariants by Approximate Image Computation
|
Balarin, Felice
|
|
1997
|
9 |
C |
p. 2-14
13 p.
|
artikel
|
Tijdschrift beschrijving