Finding Your Way in a Forest: On Different Types of Trees and Their Properties -- Simple Stochastic Games with Few Random Vertices Are Easy to Solve -- The Complexity of Nash Equilibria in Infinite Multiplayer Games -- Stochastic Games with Lossy Channels -- Simulation Hemi-metrics between Infinite-State Stochastic Games -- Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics -- A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract) -- The ?-Regular Post Embedding Problem -- Complexity of Decision Problems for Mixed and Modal Specifications -- Classes of Tree Homomorphisms with Decidable Preservation of Regularity -- A Kleene-Schützenberger Theorem for Weighted Timed Automata -- Robust Analysis of Timed Automata Via Channel Machines -- The Common Fragment of ACTL and LTL -- The Complexity of CTL* + Linear Past -- Footprints in Local Reasoning -- A Modal Deconstruction of Access Control Logics -- Coalgebraic Logic and Synthesis of Mealy Machines -- The Microcosm Principle and Concurrency in Coalgebra -- Systems of Equations Satisfied in All Commutative Finite Semigroups -- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity -- On Decision Problems for Probabilistic Büchi Automata -- Model-Checking ?-Regular Properties of Interval Markov Chains -- Prevision Domains and Convex Powercones -- RPO, Second-Order Contexts, and ?-Calculus -- Erasure and Polymorphism in Pure Type Systems -- The Implicit Calculus of Constructions as a Programming Language with Dependent Types -- Strong Normalisation of Cut-Elimination That Simulates ?-Reduction -- Symbolic Semantics Revisited -- Deriving Bisimulation Congruences in the Presence of Negative Application Conditions -- Structural Operational Semantics for StochasticProcess Calculi -- Compositional Methods for Information-Hiding -- Products of Message Sequence Charts -- What Else Is Decidable about Integer Arrays? -- Model Checking Freeze LTL over One-Counter Automata.