Logic for Concurrency and Synchronisation Geometry of Deduction Via Graphs of Proofs Chu’s Construction: A Proof Theoretic Approach Two Paradigms of Logical Computation in Affine Logic Proof Systems for  Calculus Logics A Tutorial Introduction to Symbolic Model Checking Modal Logics for Finite Graphs Bisimulation and Language Equivalence. The study of information based actions and processes has been a vibrant terface between logic and computer science for several decades now. Indeed several natural perspectives come together here. On the one hand logical s tems may be used to describe the dynamics of arbitrary computational p cesses – as in the many sophisticated process logics available today. But also key logical notions such as model checking or proof search are themselves informational processes involving agents with goals. The interplay between these descriptive and dynamic aspects shows even in our ordinary language. A word like “proof” hdenotes both a static ‘certificate’ of truth and an activity which humans or machines engage in. Increasing our understanding of l ics of this sort tells us something about computer science and about cognitive actions in general. The individual chapters of this book show the state of the art in current vestigations of process calculi such as linear logic and – with mainly two major paradigms at work namely linear logic and modal logic. These techniques are applied to the title themes of concurrency and synchronisation but there are also many repercussions for topics such as the geometry of proofs categorial semantics and logics of graphs. Viewed gether the chapters also offer exciting glimpses of future integration as the reader moves back and forth through the book.