Layout Randomization and Nondeterminism -- Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations -- An Operational Interpretation of Negative Probabilities and No-Signalling Models -- Bisimulation on Markov Processes over Arbitrary Measurable Spaces -- Probabilistic Model Checking for Energy-Utility Analysis -- (Co)Algebraic Characterizations of Signal Flow Graphs -- Fractal Sets as Final Coalgebras Obtained by Completing an Initial Algebra -- Leaving Traces: A Note on a Sound and Complete Trace Logic for Concurrent Constraint Programs -- Privacy from Accelerating Eavesdroppers: The Impact of Losses -- The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata -- From Haar to Lebesgue via Domain Theory -- Word Order Alternation in Sanskrit via Precyclicity in Pregroup Grammars -- The Logic of Entanglement -- Free Energy of Petri Nets -- Laudatio for Prakash Panangaden -- Generalized Differential Privacy: Regions of Priors That Admit Robust Optimal Mechanisms -- Bisimulation for Markov Decision Processes through Families of Functional Expressions -- Random Measurable Selections -- A Final Coalgebra for k-regular Sequences -- Automata Learning: A Categorical Perspective -- Optimal Coin Flipping -- Entanglement, Flow and Classical Simulatability in Measurement Based Quantum Computation -- Euclidean Representations of Quantum States -- TCC, with History -- Probabilistic and Quantum Event Structures.

This Festschrift volume contains papers presented at a conference, Prakash Fest, held in honor of Prakash Panangaden, in Oxford, UK, in May 2014, to celebrate his 60th birthday. Prakash Panangaden has worked on a large variety of topics including probabilistic and concurrent computation, logics and duality and quantum information and computation. Despite the enormous breadth of his research, he has made significant and deep contributions. For example, he introduced logic and a real-valued interpretation of the logic to capture equivalence of probabilistic processes quantitatively. The 25 papers included in this volume were carefully reviewed. They cover a large variety of topics in theoretical computer science.