Theoretical Computer Science, Volume 308
Volume 308, Number 1-3, November 2003
Jan J. M. M. Rutten: Behavioural differential equations: a coinductive calculus of streams, automata, and power series. 1-53- Walter Keller: Clustering for Petri nets. 145-197
- Karim Nour, Christophe Raffalli: Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic. 227-237
- Jean-Louis Krivine: Dependent choice, `quote' and the clock. 259-276
- Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot: Model checking mobile ambients. 277-331
- Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong: Adapting innocent game models for the Böhm treelambda -theory. 333-366
- Yifeng Chen: A fixpoint theory for non-monotonic parallelism. 367-392
- Paulo Mateus, M. Morais, C. Nunes, António Pacheco, Amílcar Sernadas, Cristina Sernadas: Categorical foundations for randomly timed automata. 393-427
- Yann Loyer, Nicolas Spyratos, Daniel Stamate: Parametrized semantics of logic programs--a unifying framework. 429-447
- Uri Abraham: Self-stabilizing timestamps. 449-515
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team