Volume 358; Issue 2-3

Theoretical Computer Science

Volume 358; Issue 2-3
1

Editorial

Philippa Gardner, Nobuko Yoshida
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 95 KB
english, 2006
2

Message-passing automata are expressively equivalent to EMSO logic

Benedikt Bollig, Martin Leucker
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 401 KB
english, 2006
3

Probabilistic event structures and domains

Daniele Varacca, Hagen Völzer, Glynn Winskel
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 359 KB
english, 2006
4

Asynchronous games 2: The true concurrency of innocence

Paul-André Melliès
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 428 KB
english, 2006
5

Characterizing EF and EX tree logics

Mikolaj Bojańczyk, Igor Walukiewicz
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 282 KB
english, 2006
6

Model checking restricted sets of timed paths

Nicolas Markey, Jean-François Raskin
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 429 KB
english, 2006
7

Elimination of quantifiers and undecidability in spatial logics for concurrency

Luís Caires, Etienne Lozes
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 395 KB
english, 2006
8

Author index

Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 117 KB
english, 2006
9

Resource control for synchronous cooperative threads

Roberto M. Amadio, Silvano Dal Zilio
Journal:
Theoretical Computer Science
Year:
2006
Language:
english
File:
PDF, 365 KB
english, 2006