## Theoretical Computer Science: 6th IFIP WG 2.2 International Conference, TCS 2010, Held as a Part of WCC 2010, Brisbane, Australia, September 20-23, 2010, ProceedingsChristian S. Calude, Vladimiro Sassone Thisvolumecontainstheinvitedandregularpaperspresentedat TCS 2010, the 6thIFIP International Conference on Theoretical Computer Science, organised by IFIP Tech- cal Committee 1 (Foundations of Computer Science) and IFIP WG 2.2 (Formal - scriptions of Programming Concepts) in association with SIGACT and EATCS. TCS 2010 was part of the World Computer Congress held in Brisbane, Australia, during September 20-23, 2010 ( ). TCS 2010 is composed of two main areas: (A) Algorithms, Complexity and Models of Computation, and (B) Logic, Semantics, Speci?cation and Veri?cation. The selection process led to the acceptance of 23 papers out of 39 submissions, eachofwhichwasreviewedbythreeProgrammeCommitteemembers.TheProgramme Committee discussion was held electronically using Easychair. The invited speakers at TCS 2010 are: Rob van Glabbeek (NICTA, Australia) Bart Jacobs (Nijmegen, The Netherlands) Catuscia Palamidessi (INRIA and LIX, Paris, France) Sabina Rossi (Venice, Italy) James Harland (Australia) and Barry Jay (Australia) acted as TCS 2010 Chairs. We take this occasion to thank the members of the Programme Committees and the external reviewers for the professional and timely work; the conference Chairs for their support; the invited speakers for their scholarly contribution; and of course the authors for submitting their work to TCS 2010. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Convexity Duality and Effects | 1 |

A Calculus for PowerA ware Multicast Communications in Ad Hoc Networks | 20 |

The Coarsest Precongruences Respecting Safety and Liveness Properties | 32 |

Entropy and Attack Models in Information Flow Invited Talk | 53 |

Safe Equivalences for Security Properties | 55 |

On Probabilistic Alternating Simulations | 71 |

Probabilistic Mobility Models for Mobile and Wireless Networks | 86 |

On Packing Splittable Items with Cardinality Constraints | 101 |

Terminating Tableaux for SOQ with Number Restrictions on Transitive Roles | 213 |

Proof System for Applied Pi Calculus | 229 |

Concurrent Pattern Calculus | 244 |

Initial Segment Complexities of Randomness Notions | 259 |

Topologies Refining the Cantor Topology on Xω | 271 |

On Symbolic Representations of Maximum Matchings and Undirected Graphs | 286 |

Traceable Sets | 301 |

Approximating the Noncontiguous Multiple Organization Packing Problem | 316 |

Broadcasting under Unstructured Mobility | 111 |

Slicing Behavior Tree Models for Verification | 125 |

Optimization of the Anisotropic Gaussian Kernelfor Text Segmentation and Parameter Extraction | 140 |

Online Dictionary Matching for Streams of XML Documents | 153 |

The Duality of Computation under Focus | 165 |

Polarized Resolution Modulo | 182 |

A Logic on Subobjects and Recognizability | 197 |

Improving the Competitive Ratios of the Seat Reservation Problem | 328 |

A SemiringBased Trace Semantics for Processes with Applications to Information Leakage Analysis | 340 |

A GameTheoretic Approach to Routing under Adversarial Conditions | 355 |

An Operational Model for Multiprocessors with Caches | 371 |

386 | |

### Other editions - View all

### Common terms and phrases

3-partition problem abstract actions algorithm applied assume automaton functor behavior bisimulation Boolean bound broadcast cache calculus clause complete Computer conﬁguration consider constraints contains convex convex sets cut free proof deﬁned Deﬁnition demand agent denote diﬀerent edge eﬀect effect algebras encoding equivalence exists ﬁnite ﬁrst ﬂow formula function f functor given graph Heidelberg iﬀ IFIP inﬁnitely input Kolmogorov complexity labelled transition systems language Lemma liveness property LNCS logic matching maximum matching mobility model checking monad node notion OBDD online algorithm operator output packets pattern pi-calculus precongruence preﬁx probabilistic alternating probabilistic automaton problem process calculus Proposition protocol random requests restriction routing agent routing game rule satisﬁes scheduler semantics sequence sequentially consistent simulation slicing speciﬁcation Springer strategy Theorem topology trace transitions tuples variables winning condition