Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008

Front Matter....Pages I-XIII
Front Matter....Pages 1-3
Ambiguity and Complementation in Recognizable Two-dimensional Languages....Pages 5-20
Algorithmic Game Theory: Some Greatest Hits and Future Directions....Pages 21-42
Synchronizing Road Coloring....Pages 43-53
Leader Election in Anonymous Rings: Franklin Goes Probabilistic....Pages 57-72
Inverse Problems Have Inverse Complexity....Pages 73-86
Literal Shuffle of Compressed Words....Pages 87-100
Reconstructing words from a fixed palindromic length sequence....Pages 101-114
The mv-decomposition: definition and application to the distance-2 broadcast problem in multi-hops radio networks....Pages 115-126
Partitioning Random Graphs with General Degree Distributions....Pages 127-141
On the Longest Common Factor Problem....Pages 143-155
Stable Dynamics of Sand Automata....Pages 157-169
On tractability of Cops and Robbers game....Pages 171-185
Computability of Tilings....Pages 187-201
A Classification of Degenerate Loop Agreement....Pages 203-213
On the expressive power of univariate equations over sets of natural numbers....Pages 215-227
Collisions and their Catenations: Ultimately Periodic Tilings of the Plane....Pages 229-240
Cache-sensitive Memory Layout for Binary Trees....Pages 241-255
Front Matter....Pages 259-259
From Processes to ODEs by Chemistry....Pages 261-281
Differential Linear Logic and Processes....Pages 283-283
Solving Monotone Polynomial Equations....Pages 285-298
Front Matter....Pages 259-259
Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras....Pages 301-316
Finite Equational Bases for Fragments of CCS with Restriction and Relabelling....Pages 317-332
μ-calculus Pushdown Module Checking with Imperfect State Information....Pages 333-348
From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in First-order Decision Procedures....Pages 349-365
On Traits and Types in a Java-like Setting....Pages 367-382
Canonical Sequent Proofs via Multi-Focusing....Pages 383-396
Universal Coinductive Characterisations of Process Semantics....Pages 397-412
Static and dynamic typing for the termination of mobile processes....Pages 413-427
Regular n -ary Queries in Trees and Variable Independence....Pages 429-443
Hamiltonicity of automatic graphs....Pages 445-459
Marking the chops: an unambiguous temporal logic....Pages 461-476
On Boundedness in Depth in the π-Calculus....Pages 477-489
A Unified View of Tree Automata and Term Schematisations....Pages 491-505
Deconstructing behavioural theories of mobility....Pages 507-520
Adequacy of Compositional Translations for Observational Semantics....Pages 521-535
The Surprising Robustness of (Closed) Timed Automata against Clock-Drift....Pages 537-553