Accepted or Published Papers by Year

• Propositional Logics for the Lawvere Quantale by Giorgio Bacci, Radu Mardare, Prakash Panangaden and Gordon Plotkin, Proceedings of the XXXIXth Conference on Mathematical Foundations Of Programming Semantics, Bloomington, Indiana, June 2023.
• Behavioural equivalences for continuous-time Markov processes by Linan Chen, Florence Clerc and Prakash Panangaden, Mathematical Structures in Computer Science, vol 33, number 4-5, pp. 222-258, 2023.
• A Kernel Perspective on Behavioural Metrics for Markov Decision Processes by Pablo Samuel Castro, Tyler Kastner, Prakash Panangaden and Mark Rowland; Transactions on Machine Learning Research, 36 pages, June 2023.
• A Categorical Characterization of Relative Entropy on Standard Borel Spaces by Nicolas Gagne and Prakash Panangaden, Logical Methods in Computer Science, Vol 19, Issue 4, pp. 10:1 - 10:18, 2023.

• Riemannian diffusion models, by Chin-Wei Huang, Milad Aghajohari, Joey Bose, Prakash Panangaden and Aaron Courville; proceedings of the Thirty-sixth Conference on Neural Information Processing Systems (NeurIPS), 2022.
• Continuous MDP Homomorphisms and Homomorphic Policy Gradient by Sahand Rezaei-Shoshtari, Rosie Zhao, Prakash Panangaden, David Meger, Doina Precup; proceedings of the Thirty-sixth Conference on Neural Information Processing Systems (NeurIPS), 2022.
• Bisimulation metrics and norms for real-weighted automata by Borja Balle, Pascale Gourdeau and Prakash Panangaden, Information and Computation, 282: 104649 (2022).

• Fixed points for Quantitative Equational Logics by Radu Mardare, Prakash Panangaden and Gordon Plotkin; Proceedings of the 2021 ACM-IEEE Symposium on Logic in Computer Science.
• Universal Semantics for the Stochastic Lambda-Calculus by Pedro H. Azevedo de Amorim, Dexter Kozen, Radu Mardare, Prakash Panangaden and Michael Roberts; Proceedings of the 2021 ACM-IEEE Symposium on Logic in Computer Science.
• Optimal Spectral-Norm Minimization of Weighted Finite-Automata by Borja Balle, Clara Lacroce, Prakash Panangaden, Doina Precup and Guillaume Rabusseau; Proceedings of the International Colloquium on Automata Languages and Programming, 2021.
• Tensor of Quantitative Equational Theories by Giorgio Bacci, Radu Mardare, Prakash Panangaden and Gordon Plotkin; Proceedings of the Ninth Conference on Algebra and Coalgebra in Computer Science (CALCO), Salzburg, Austria, 2021.
• Extracting Weighted Automata for Approximate Minimization in Language Modelling, by Clara Lacroce, Prakash Panangaden, Guillaume Rabusseau; Proceedings of the Fifteenth International Conference on Grammatical Inference, published as Proceedings of Machine Learning Research 153:92-112, 2021.
• MICo: Improved representations via sampling-based state similarity for Markov decision processes, by Pablo Samuel Castro, Tyler Kastner, Prakash Panangaden and Mark Rowland; proceedings of the Thirty-Fifth Conference on Neural Information Processing Systems (NeurIPS), 2021. Expanded version.
• Weighted automata are compact and actively learnable by Artem Kaznatcheev and Prakash Panangaden: Inf. Process. Lett. 171: 106133 (2021).

• A Distributional Analysis of Sampling-based Reinforcement Learning Algorithms by Philip Amortila, Doina Precup, Prakash Panangaden and Marc Bellemare, proceedings of The 23rd International Conference on Artificial Intelligence and Statistics (AISTATS) 2020.
• Latent Variable Modelling with Hyperbolic Normalizing Flows by Joey Bose, Ariella Smofsky, Renjie Liao, Prakash Panangaden and Will Hamilton in the Proceedings of the Thirty-seventh International Conference on Machine Learning (ICML), 2020.
• Towards a Classification of Behavioural Equivalences in Continuous-time Markov Processes by Linan Chen, Florence Clerc and Prakash Panangaden in the Proceedings of the 36th International Conference on Mathematical Foundations of Programming Semantics (MFPS) 2020.

• Bisimulation for Feller-Dynkin Processes by Linan Chen, Florence Clerc and Prakash Panangaden, Proceedings of the Thirty-Fifth Conference on the Mathematical Foundations of Programming Semantics, {MFPS} 2019, London, UK, June 4-7, 2019; ENTCS, volume 347, pages 45--63.
• Singular Value Automata and Approximate Minimization, Borja Balle, Prakash Panangaden and Doina Precup, in press, Mathematical Structures In Computer Science, 29(9), 1444-1478, 2019. Full version of the conference paper from 2015.
• Expressiveness of probabilistic modal logics: a gradual approach , Florence Clerc, Nathanael Fijalkow, Bartek Klin and Prakash Panangaden, Information and Computation, 267: 145-163, 2019. Full version of the ICALP 2017 paper.

• Boolean-Valued Semantics for the Stochastic Lambda-Calculus Giorgio Bacci, Robert Furber, Dexter Kozen, Radu Mardare, Prakash Panangaden and Dana Scott. (LICS 2018)
• An algebraic theory of Markov processes, Giorgio Bacci, Radu Mardare, Prakash Panangaden and Gordon Plotkin. (LICS 2018)
• Free complete Wasserstein algebras by Radu Mardare, Prakash Panangaden and Gordon D. Plotkin, Logical Methods in Computer Science, volume 14, number 3, 2018.Furio Honsell Festschrift.
• A Categorical Characterization of Relative Entropy on Standard Borel Spaces by Nicolas Gagne and Prakash Panangaden, Electr. Notes Theor. Comput. Sci.,volume 336, pages 135--153, 2018.

• Unrestricted Stone duality for Markov processes, Robert Furber, Dexter Kozen, Kim Larsen, Radu Mardare and Prakash Panangaden. (LICS 2017)
• On the axiomatizability of quantitative algebras, Radu Mardare, Prakash Panangaden and Gordon Plotkin. (LICS 2017)
• Expressiveness of probabilistic modal logics revisited, Nathanael Fijalkow, Bartek Klin and Prakash Panangaden. (ICALP 2017)
• Bisimulation metrics for weighted finite automata, Borja de Balle, Pascale Gourdeau and Prakash Panangaden. (ICALP 2017)
• Bicategories of Markov processes, Florence Clerc, Harrison Humphrey and Prakash Panangaden. Kim Larsen Festschrift.

• Quantitative algebraic reasoning , Radu Mardare, Prakash Panangaden and Gordon Plotkin, in ACM-IEEE Symposium On Logic In Computer Science 2016.

• Basis refinement strategies for linear value function approximation in MDPs, Gheorghe Comanici, Doina Precup and Prakash Panangaden. Advances in Neural Information Processing Systems 28, pages 2881-2889, 2015.
• A Canonical Form for Weighted Automata and Applications to Approximate Minimization, Borja Balle, Prakash Panangaden and Doina Precup, Proceedings of the Thirtieth Annual ACM-IEEE Symposium on Logic in Computer Science, 2015.
• Quantum Alternation; Problems and Prospects, Costin Badescu and Prakash Panangaden, Proceedings of the Conference on Quantum Physics and Logic.
• Representation Discovery for MDPs Using Bisimulation Metrics, Sherry Shanshan Ruan, Gheorghe Comanici, Prakash Panangaden and Doina Precup, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015, pp. 3578-3584.

• An exact expression for Photon Polarization in Kerr Geometry by Anusar Farooqui, Niky Kamran and Prakash Panangaden, in Advances in Theoretical and Mathematical Physics, Vol. 8, No. 3, pp. 657-684, 2014.
• A Metrized Duality Theorem for Markov Processes by Dexter Kozen, Radu Mardare and Prakash Panangaden, in Electronic Notes in Theoretical Computer Science Vol. 308, pp. 211-227, proceedings of Mathematical Foundations of Programming Semantics, 2014.
• A logical basis for quantum evolution and entanglement by Richard Blute, Alessio Guglielmi, Ivan T. Ivanov, Prakash Panangaden and Ltuz Strassburger, in Categories and Types in Language, Logic and Physics -- Essays dedicated to Jim Lambek on the occasion of his 90th birthday. Lecture Notes In Computer Science 8222, pp. 90-107.
• Causality in Physics and Computation by Prakash Panangaden, Theoretical Computer Science, Vol. 546, pp. 10-16, March 2014.
• Algebra-coalgebra Duality in Brzozwski's Minimization Algorithm by F. Bonchi, M. M. Bonsangue, H. H. Hansen, P. Panangaden, J. J. M. M. Rutten and A. Silva, ACM Transactions on Computational Logic, Vol. 19(1), article 3, 2014.
• Approximating Markov Processes by Averaging by Philippe Chaput, Vincent Danos, Prakash Panangaden and Gordon Plotkin. Full (and significantly rewritten) version of the ICALP 2009 paper; Journal of the Association of Computing Machinery, Vol. 61, No. 1, Jan 2014.
• Fair reactive programming by Andrew Cave, Francisco Ferreira, Prakash Panangaden and Brigitte Pientka; Principles of Programming Languages, January 2014.

• Stone Duality for Markov Processes by Dexter Kozen, Kim G. Larsen, Radu Mardare and Prakash Panangaden, in ACM-IEEE Symposium On Logic In Computer Science 2013.
• Stone Duality for Markov Processes by Dexter Kozen, Kim G. Larsen, Radu Mardare and Prakash Panangaden, longer technical report version.
• Strong Completeness for Markovian Logics by Dexter Kozen, Radu Mardare and Prakash Panangaden, in MFCS 2013.
• Strong Completeness for Markovian Logics by Dexter Kozen, Radu Mardare and Prakash Panangaden, longer TR version.
• The Duality of State and Observation in Probabilistic Transition Systems by Monica Dinculescu, Christopher Hundt, Prakash Panangaden, Joelle Pineau and Doina Precup; in Language, Logic and Computation, revised selected papers from the 9th International Tbilisi Symposium TbiLLC 2011, Kutaisi, Georgia, Sept. 26-30, 2011. Lecture Notes In Computer Science 7758, pages 206-230, 2013.

• On-the-fly algorithms for bisimulation metrics by Gheorghe Comanici, Prakash Panangaden and Doina Precup, in Proceedings of QEST 2012, IEEE Computer Society.
• Spatial and epistemic modalities in constraint-based process calculi by Sophia Knight, Catuscia Palamidessi, Prakash Panangaden and Frank Valencia, in Proceedings of CONCUR 2012, Lecture Notes In Computer Science 7454, pp. 317-332.
• Minimization via duality by Nick Bezhanishvili, Clemens Kupke and Prakash Panangaden, in Proceedings of Wollic 2012, Buenos Aires, Argentina, Lecture Notes In Computer Science 7456, pp. 191-205.
• Taking it to the limit: approximate reasoning for Markov processes by Kim G. Larsen, Radu Mardare and Prakash Panangaden, in Proceedings of MFCS, Lecture Notes In Computer Science 7464, pp. 681-692.
• Combining Epistemic Logic and Hennessy-Milner Logic by Sophia Knight, Radu Mardare and Prakash Panangaden, in Dexter Kozen's Festschrift published as Logic and Program Semantics, Lecture Notes In Computer Science 7230, eds. Robert Constable and Alexandra Silva, pp. 219-243.
• Epistemic strategies and games on concurrent processes by Sophia Knight, Konstantinos Chatzikokolakis, Catuscia Palamidessi and Prakash Panangaden, ACM Transactions on Computational Logic, 2012, vol 13, number 4.
• Deep Inference and Probabilistic Coherence Spaces, by Richard Blute, Prakash Panangaden and Sergey Slavnov, Journal of Applied Categorical Structures, 2012.
• Quantum communication in Rindler spacetime by Kamil Bradler, Patrick Hayden and Prakash Panangaden, Communications of Mathematical Physics, 2012, Vol 312, number 2, pp. 361-398.
• Reconstruction of spacetime geometry from causal structure and a measurement; by Keye Martin and Prakash Panangaden, in Mathematical Foundations of Information Flow, Proceedings of the 2008 Clifford Lectures, Proceedings of Symposia in Applied Mathematics, AMS, volume 71, pp. 213-232, 2012.

• Bisimulation metrics for continuous Markov decision processes by Norm Ferns, Prakash Panangaden and Doina Precup, SIAM Journal of Computing, volume 60, number 4, pp. 1662-1714, 2011.

• Domains in general relativity by Keye Martin and Prakash Panangaden in New Structures for Physics ed. Bob Coecke.
• Proof nets as formal Feynman diagrams. by Richard Blute and Prakash Panangaden in New Structures for Physics ed. Bob Coecke.
• Dagger categories and formal distributions by Richard Blute and Prakash Panangaden in New Structures for Physics ed. Bob Coecke.
• A categorical view of computing with anyons by Prakash Panangaden and Eric Paquette in New Structures for Physics ed. Bob Coecke.
• pCTL* is Sound and Complete for Weak Bisimulation by Joseé Desharnais, Vineet Gupta, Radhakrishnan Jagadeesan and Prakash Panangaden, Information and Computation, Jan 2010.
• Learning in a changing world. by Prakash Panangaden and Mehrnoosh Sadrzadeh, AMAST 2010. June 2010, Quebec City.

• Extended Measurement Calculus by Vincent Danos, Elham Kashefi, Prakash Panangaden and Simon Perdrix, in Semantic Techniques for Quantum Computation edited by Simon Gay and Ian Mackie.
• Notions of state equivalence under partial observability by Pablo Castro, Prakash Panangaden and Doina Precup, Proceedings of IJCAI 2009.
• Approximating Markov processes by averaging by Philippe Chaput, Vincent Danos, Prakash Panangaden and Gordon Plotkin, Proceedings of ICALP 2009.
• Epistemic strategies and games on concurrent processes by Konstantinos Chatzikokolakis, Sophia Knight and Prakash Panangaden, Proceedings of SOFSEM'09.

• Bounding Performance Loss in Approximate MDP Homomorphisms. Neural Information Processing Systems Conference NIPS 2008 December 2008
• Game semantics for quantum stores. XXIV Symposium on Mathematical Foundations of Programming Semantics May 2008
• A technique for verifying measurements. XXIV Symposium on Mathematical Foundations of Programming Semantics May 2008
• On the Bayes-risk of information-hiding protocols. Journal of Computer Security, 16(5):531-571,2008.
• Anonymity Protocols as Noisy Channels. Information and Computation, 206(2-4):378-401,2008.
  

• The Measurement Calculus [PDF] Journal Of The Association Of Computing Machinery, Vol 52,issue 2, article 8, March 2007.
  

• A Domain of spacetime intervals for General relativity by Keye Martin and Prakash Panangaden. [PDF] Communications of Mathematical Physics, Nov 2006.
• Quantum Weakest Preconditions by Ellie D'Hondt and Prakash Panangaden. Mathematical Structures in Computer Science, 16(3), 429-451, June 2006.
• The computatinal power of the W and GHZ states by Ellie D'Hondt and Prakash Panangaden; Quantum Information and Computation, 6(2), 2006, 173-183.
• Bisimulation and Cocongruence for Probabilistic Systems by Vincent Danos, Josee Desharnais, Francois Laviolette and Prakash Panangaden. Information and Computation 204(4), 503-523, 2006.
• Approximate Reasoning for Real-time Probabilistic Processes by Vineet Gupta, Radha Jagadeesan and Prakash Panangaden, Logical Methods in Computer Science, 2(1), paper 4, 2006.
• Representing systems with hidden state. AAAI 2006.
  

• Metrics for Markov Decision Processes with Infinite State Spaces by Norm Ferns, Prakash Panangaden and Doina Precup. In UAI 2005. [PDF].
• An approximation algorithm for labelled Markov processes: towards realistic approximation, by Alex Bouchard-Cote, Norm Ferns, Prakash Panangaden and Doina Precup. In QEST 2005. [PDF]
• Parsimonious and robust realizations of unitary maps in the one-way model by Vincent Danos, Elham Kashefi and Prakash Panangaden, Physical Review A 72, 064301, Dec 2005.
  

• Metrics for Labelled Markov Processes, by Jos\'ee Desharnais, Vineet Gupta, Radhakrishnan Jagadeesan and Prakash Panangaden, Theoretical Computer Science, 318(3), pp. 323-354, June 2004.
• A Relational Model for Nondeterministic Dataflow, by Thomas Hildebrandt, Prakash Panangaden and Glynn Winskel, Mathematical Structures in Computer Science, 14(5), pp. 613-649, October 2004.
• Labelled Markov Processes: Stronger and Faster Approximations by Vincent Danos and Jos{\'e}e Desharnais and Prakash Panangaden; Electronic Notes in Theoretical Computer Science, 87, pp. 157-203, Nov 2004.
• Approximate reasoning for real-time probabilistic processes by Vineet Gupta, Radha Jagadeesan and Prakash Panangaden. First Symposium on Quantitative Evaluation of Systems QEST04; Twente, The Netherlands.
• Metrics for Finite Markov Decision Precesses by Norm Ferns, Prakash Panangaden and Doina Precup, Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, pp. 162-169, Banff, Canada, July 2004.
  

• Conditional Expectation and the Approximation of Labeled Markov Processes by Vincent Danos, Josee Desharnais and Prakash Panangaden, Proceedings of the 14th International Conference on Concurrency Theory, CONCUR03, Marseilles, France, September 2003. Lecture Notes In Computer Science 2761 pp. 477-491
• Discrete Quantum Causal Dynamics by Richard Blute, Ivan T. Ivanov and Prakash Panangaden. International Journal of Theoretical Physics Volume 42, number 9, pages 2025-2041, Sept 2003.
• Approximating Continuous Markov Processes by Josee Desharnais, Vineet Gupta, Radha Jagadeesan and Prakash Panangaden, Information and Computation, 184(1), pp. 160-200, July 2003
• Continuous Stochastic Logic Characterizes Bisimulation for Continuous-time Markov Processes by Josee Desharnais and Prakash Panangaden. Journal of Logic and Algebraic Progamming special issue on Probabilistic Techniques for the Design and Analysis of Systems, 56 (2003) 99-115.
  

• The Metric Analogue of Weak Bisimulation for Probabilistic Processes by Josee Desharnais, Vineet Gupta, Radha Jagadeesan and Prakash Panangaden. Full version of the LICS 2002 paper.
• Weak Bisimulation is Sound and Complete for pCTL* by Josee Desharnais, Vineet Gupta, Radha Jagadeesan and Prakash Panangaden. CONCUR'02.
• Bisimulation for Labelled Markov Processes , by Josee Desharnais, Abbas Edalat and Prakash Panangaden. This is an extended version that unifies the results of our two LICS (1997 (with Rick Blute) and 1998) papers on this topic. Information and Computation, 179(2), pp. 163-193, Dec, 2002.
  
  
2001


• Measure and Probability for Concurrency Theorists, Prakash Panangaden, Theoretical Computer Science, 253, pp. 287-309, 2001.
• On the Expressive Power of First-order Boolean Functions in PCF, Riccardo Pucella and Prakash Panangaden, Theoretical Computer Science, 266, pp. 543-567, 2001.
  
  2000
  
  
• Approximating Labeled Markov Processes, by Jos\'ee Desharnais, Vineet Gupta, Radhakrishnan Jagadeesan and Prakash Panangaden, Proceedings of the Fifteenth Annual IEEE Symposium On Logic In Computer Science, Santa Barbara, California, USA, June 2000, pp. 95-106.
• Generating Irregular Partitionable Data-Structures, by Prakash Panangaden and Clark Verbrugge, Theoretical Computer Science, 238, pp. 31-80, 2000.
  

• The Category of Markov Kernels, Prakash Panangaden, ENTCS, Vol 22, 1999. 17 pages.
• Nuclear and Trace Ideals in Tensored *-Categories,, by Samson Abramsky, Richard Blute and Prakash Panangaden. Journal of Pure and Applied Algebra, Vol: 143, Issue: 1-3, 1999, pp. 3-47.
• Stochastic Processes as Concurrent Constraint Programs by Vineet Gupta, Radha Jagadeesan and Prakash Panangaden. POPL 1999.
• Metrics for Labeled Markov Systems by Josee Desharnais, Vineet Gupta, Radha Jagadeesan and Prakash Panangaden. CONCUR 1999.