nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A New Approach to Upward-Closed Set Backward Reachability Analysis
|
Bingham, Jesse |
|
2005 |
138 |
3 |
p. 37-48 12 p. |
artikel |
2 |
Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time
|
Kot, Martin |
|
2005 |
138 |
3 |
p. 49-60 12 p. |
artikel |
3 |
Closed, Open, and Robust Timed Networks
|
Abdulla, Parosh Aziz |
|
2005 |
138 |
3 |
p. 117-151 35 p. |
artikel |
4 |
Decidability of Reachability for Polymorphic Systems with Arrays: A Complete Classification
|
Lazić, Ranko |
|
2005 |
138 |
3 |
p. 3-19 17 p. |
artikel |
5 |
Handling Liveness Properties in (ω-)Regular Model Checking
|
Bouajjani, Ahmed |
|
2005 |
138 |
3 |
p. 101-115 15 p. |
artikel |
6 |
Inference of Timed Transition Systems
|
Grinchtein, Olga |
|
2005 |
138 |
3 |
p. 87-99 13 p. |
artikel |
7 |
Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting
|
Lazić, Ranko |
|
2005 |
138 |
3 |
p. 61-86 26 p. |
artikel |
8 |
Preface
|
Bradfield, Julian |
|
2005 |
138 |
3 |
p. 1- 1 p. |
artikel |
9 |
Reachability Analysis of Synchronized PA Systems
|
Bouajjani, Ahmed |
|
2005 |
138 |
3 |
p. 153-178 26 p. |
artikel |
10 |
Regular Model Checking Using Inference of Regular Languages
|
Habermehl, Peter |
|
2005 |
138 |
3 |
p. 21-36 16 p. |
artikel |