nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Logical Process Calculus
|
Cleaveland, Ranee |
|
2002 |
68 |
2 |
p. 33-50 18 p. |
artikel |
2 |
Alternating Context-Free Languages and Linear Time μ-Calculus with Sequential Composition
|
Lange, Martin |
|
2002 |
68 |
2 |
p. 70-86 17 p. |
artikel |
3 |
Deriving Bisimulation Congruences: A 2-categorical Approach
|
Sassone, Vladimiro |
|
2002 |
68 |
2 |
p. 105-123 19 p. |
artikel |
4 |
Describing properties of concurrent systems (Logic for Traces)
|
Igor, Walukiewicz |
|
2002 |
68 |
2 |
p. 69- 1 p. |
artikel |
5 |
Interaction Nets with McCarthy's amb
|
Fernández, Maribel |
|
2002 |
68 |
2 |
p. 51-68 18 p. |
artikel |
6 |
Modal Logics for Cryptographic Processes
|
Frendrup, Ulrik |
|
2002 |
68 |
2 |
p. 124-141 18 p. |
artikel |
7 |
On the Expressive Power of Polyadic Synchronisation in π-calculus
|
Carbone, Marco |
|
2002 |
68 |
2 |
p. 15-32 18 p. |
artikel |
8 |
On the Expressive Power of Temporal Concurrent Constraint Programming Languages
|
Palamidessi, Catuscia |
|
2002 |
68 |
2 |
p. 3- 1 p. |
artikel |
9 |
Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past
|
Markey, Nicolas |
|
2002 |
68 |
2 |
p. 87-104 18 p. |
artikel |
10 |
Preface
|
Uwe, Nestmann |
|
2002 |
68 |
2 |
p. 1-2 2 p. |
artikel |
11 |
The probability nesting game
|
Beauquier, Danièle |
|
2002 |
68 |
2 |
p. 4-14 11 p. |
artikel |
12 |
Timed CSP = Closed Timed Automata1
|
Ouaknine, Joël |
|
2002 |
68 |
2 |
p. 142-159 18 p. |
artikel |