Prakash Panangaden

Affiliations:
  • McGill University, Montreal, Canada


According to our database1, Prakash Panangaden authored at least 196 papers between 1984 and 2024.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2020, "For making continuous state systems amenable to logical and computational treatment".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Polynomial Lawvere Logic.
CoRR, 2024

2023
Behavioural equivalences for continuous-time Markov processes.
Math. Struct. Comput. Sci., 2023

Behavioural pseudometrics for continuous-time diffusions.
CoRR, 2023

Conditions on Preference Relations that Guarantee the Existence of Optimal Policies.
CoRR, 2023

A Kernel Perspective on Behavioural Metrics for Markov Decision Processes.
CoRR, 2023

Optimal Approximate Minimization of One-Letter Weighted Finite Automata.
CoRR, 2023

Policy Gradient Methods in the Presence of Symmetries and State Abstractions.
CoRR, 2023

Propositional Logics for the Lawvere Quantale.
Proceedings of the 39th Conference on the Mathematical Foundations of Programming Semantics, 2023

2022
Bisimulation metrics and norms for real-weighted automata.
Inf. Comput., 2022

Augmenting Human Selves Through Artificial Agents - Lessons From the Brain.
Frontiers Comput. Neurosci., 2022

Sum and Tensor of Quantitative Effects.
CoRR, 2022

Riemannian Diffusion Models.
CoRR, 2022

Towards an AAK Theory Approach to Approximate Minimization in the Multi-Letter Case.
CoRR, 2022

Continuous MDP Homomorphisms and Homomorphic Policy Gradient.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Riemannian Diffusion Models.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Weighted automata are compact and actively learnable.
Inf. Process. Lett., 2021

Interpreting Lambda Calculus in Domain-Valued Random Variables.
CoRR, 2021

MICo: Learning improved representations via sampling-based state similarity for Markov decision processes.
CoRR, 2021

MICo: Improved representations via sampling-based state similarity for Markov decision processes.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Fixed-Points for Quantitative Equational Logics.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Universal Semantics for the Stochastic λ-Calculus.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Extracting Weighted Automata for Approximate Minimization in Language Modelling.
Proceedings of the 15th International Conference on Grammatical Inference, 2021

Optimal Spectral-Norm Approximate Minimization of Weighted Finite Automata.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Tensor of Quantitative Equational Theories.
Proceedings of the 9th Conference on Algebra and Coalgebra in Computer Science, 2021

2020
Universal Semantics for the Stochastic Lambda-Calculus.
CoRR, 2020

A Study of Policy Gradient on a Class of Exactly Solvable Models.
CoRR, 2020

Minimisation in Logical Form.
CoRR, 2020

Towards a Classification of Behavioural Equivalences in Continuous-time Markov Processes.
Proceedings of the 36th Conference on the Mathematical Foundations of Programming Semantics, 2020

Latent Variable Modelling with Hyperbolic Normalizing Flows.
Proceedings of the 37th International Conference on Machine Learning, 2020

A Distributional Analysis of Sampling-Based Reinforcement Learning Algorithms.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Singular value automata and approximate minimization.
Math. Struct. Comput. Sci., 2019

Expressiveness of probabilistic modal logics: A gradual approach.
Inf. Comput., 2019

Bisimulation for Feller-Dynkin Processes.
Proceedings of the Thirty-Fifth Conference on the Mathematical Foundations of Programming Semantics, 2019

Temporally Extended Metrics for Markov Decision Processes.
Proceedings of the Workshop on Artificial Intelligence Safety 2019 co-located with the Thirty-Third AAAI Conference on Artificial Intelligence 2019 (AAAI-19), 2019

2018
Free complete Wasserstein algebras.
Log. Methods Comput. Sci., 2018

A Categorical Characterization of Relative Entropy on Standard Borel Spaces.
Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, 2018

An Algebraic Theory of Markov Processes.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Boolean-Valued Semantics for the Stochastic λ-Calculus.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
2017 Kleene award.
ACM SIGLOG News, 2017

2017 LICS test-of-time award.
ACM SIGLOG News, 2017

The 2017 Alonzo Church award.
ACM SIGLOG News, 2017

Editorial comments on the short note by Barry Jay.
J. Log. Algebraic Methods Program., 2017

A categorical characterization of relative entropy on Polish spaces.
CoRR, 2017

On the axiomatizability of quantitative algebras.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Unrestricted stone duality for Markov processes.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Expressiveness of Probabilistic Modal Logics, Revisited.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Bisimulation Metrics for Weighted Automata.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Bicategories of Markov Processes.
Proceedings of the Models, Algorithms, Logics and Tools, 2017

2016
Semantics column.
ACM SIGLOG News, 2016

Special Issue on Quantum Physics and Logic.
New Gener. Comput., 2016

Preface.
Inf. Comput., 2016

Quantitative Algebraic Reasoning.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Fond (and Frank) Memories of Frank.
Proceedings of the Theory and Practice of Formal Methods, 2016

2015
Probabilistic bisimulation.
ACM SIGLOG News, 2015

Quantum Alternation: Prospects and Problems.
Proceedings of the Proceedings 12th International Workshop on Quantum Physics and Logic, 2015

Basis refinement strategies for linear value function approximation in MDPs.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

A Canonical Form for Weighted Automata and Applications to Approximate Minimization.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

On the Formal Verification of Optical Quantum Gates in HOL.
Proceedings of the Formal Methods for Industrial Critical Systems, 2015

Representation Discovery for MDPs Using Bisimulation Metrics.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Algebra-coalgebra duality in Brzozowski's minimization algorithm.
ACM Trans. Comput. Log., 2014

Causality in physics and computation.
Theor. Comput. Sci., 2014

Approximating Markov Processes by Averaging.
J. ACM, 2014

A Metrized Duality Theorem for Markov Processes.
Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics, 2014

Fair reactive programming.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

A Logical Basis for Quantum Evolution and Entanglement.
Proceedings of the Categories and Types in Logic, Language, and Physics, 2014

2013
Preface to special issue: Developments In Computational Models 2010.
Math. Struct. Comput. Sci., 2013

Strong Completeness for Markovian Logics.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Duality in Logic and Computation.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Stone Duality for Markov Processes.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Quantum Field Theory for Legspinners.
Proceedings of the Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, 2013

2012
Epistemic Strategies and Games on Concurrent Processes.
ACM Trans. Comput. Log., 2012

Dedication.
Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012

Deep Inference and Probabilistic Coherence Spaces.
Appl. Categorical Struct., 2012

Minimization via Duality.
Proceedings of the Logic, Language, Information and Computation, 2012

On-the-Fly Algorithms for Bisimulation Metrics.
Proceedings of the Ninth International Conference on Quantitative Evaluation of Systems, 2012

Taking It to the Limit: Approximate Reasoning for Markov Processes.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Spatial and Epistemic Modalities in Constraint-Based Process Calculi.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

Dexter Kozen's Influence on the Theory of Labelled Markov Processes.
Proceedings of the Logic and Program Semantics, 2012

Combining Epistemic Logic and Hennessy-Milner Logic.
Proceedings of the Logic and Program Semantics, 2012

Probabilistic bisimulation.
Proceedings of the Advanced Topics in Bisimulation and Coinduction., 2012

2011
Bisimulation Metrics for Continuous Markov Decision Processes.
SIAM J. Comput., 2011

The Duality of State and Observation in Probabilistic Transition Systems.
Proceedings of the Logic, Language, and Computation, 2011

The Meaning of Semantics.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

The Search for Structure in Quantum Computation.
Proceedings of the Foundations of Software Science and Computational Structures, 2011

Quantum Information Channels in Curved Spacetime.
Proceedings of the Models of Computation in Context, 2011

2010
Special Issue on "Quantitative Evaluation of Systems".
Perform. Evaluation, 2010

Weak bisimulation is sound and complete for pCTL<sup>*</sup>.
Inf. Comput., 2010

Towards a Logic for Reasoning About Learning in a Changing World.
Proceedings of the 3rd International Workshop on Logics, Agents, and Mobility, 2010

An Algebraic Approach to Dynamic Epistemic Logic.
Proceedings of the 23rd International Workshop on Description Logics (DL 2010), 2010

Learning in a Changing World, an Algebraic Modal Logical Approach.
Proceedings of the Algebraic Methodology and Software Technology, 2010

2009
Preface.
Proceedings of the 6th International Workshop on Quantum Physics and Logic, 2009

Epistemic Strategies and Games on Concurrent Processes.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Equivalence Relations in Fully and Partially Observable Markov Decision Processes.
Proceedings of the IJCAI 2009, 2009

Approximating Labelled Markov Processes Again!
Proceedings of the Algebra and Coalgebra in Computer Science, 2009

Labelled Markov Processes.
Imperial College Press, ISBN: 978-1-84816-287-7, 2009

2008
Foreword.
Theor. Comput. Sci., 2008

On the Bayes risk in information-hiding protocols.
J. Comput. Secur., 2008

Anonymity protocols as noisy channels.
Inf. Comput., 2008

A Technique for Verifying Measurements.
Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics, 2008

Preface.
Proceedings of the 6th Workshop on Security Issues in Concurrency, 2008

Game Semantics for Quantum Stores.
Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics, 2008

Preface.
Proceedings of the Joint 5th International Workshop on Quantum Physics and Logic and 4th Workshop on Developments in Computational Models, 2008

Preface.
Proceedings of the First International Conference on Foundations of Informatics, 2008

Bounding Performance Loss in Approximate MDP Homomorphisms.
Proceedings of the Advances in Neural Information Processing Systems 21, 2008

Knowledge and Information in Probabilistic Systems.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

Domain Theory and the Causal Structure of Space-Time.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
The measurement calculus.
J. ACM, 2007

Conformal Field Theory as a Nuclear Functor.
Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

Formal Approaches to Information-Hiding (Tutorial).
Proceedings of the Trustworthy Global Computing, Third Symposium, 2007

Probability of Error in Information-Hiding Protocols.
Proceedings of the 20th IEEE Computer Security Foundations Symposium, 2007

2006
Foreword.
Theor. Comput. Sci., 2006

The computational power of the W And GHZ States.
Quantum Inf. Comput., 2006

Quantum weakest preconditions.
Math. Struct. Comput. Sci., 2006

Approximate reasoning for real-time probabilistic processes.
Log. Methods Comput. Sci., 2006

Bisimulation and cocongruence for probabilistic systems.
Inf. Comput., 2006

Methods for Computing State Similarity in Markov Decision Processes.
Proceedings of the UAI '06, 2006

The One Way to Quantum Computation.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

06341 Abstracts Collection -- Computational Structures for Modelling Space, Time and Causality.
Proceedings of the Computational Structures for Modelling Space, Time and Causality, 20.08., 2006

Representing Systems with Hidden State.
Proceedings of the Proceedings, 2006

2005
Distributed Measurement-based Quantum Computation.
Proceedings of the 3rd International Workshop on Quantum Programming Languages, 2005

Metrics for Markov Decision Processes with Infinite State Spaces.
Proceedings of the UAI '05, 2005

An approximation algorithm for labelled Markov processes: towards realistic approximation.
Proceedings of the Second International Conference on the Quantitative Evaluaiton of Systems (QEST 2005), 2005

Foreword.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Reasoning About Quantum Knowledge.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

A domain of spacetime intervals in general relativity.
Proceedings of the Spatial Representation: Discrete vs. Continuous Computational Models, 2005

04351 Abstracts Collection - Spatial Representation: Discrete vs. Continuous Computational Models.
Proceedings of the Spatial Representation: Discrete vs. Continuous Computational Models, 2005

04351 Summary - Spatial Representation: Discrete vs. Continuous Computational Models.
Proceedings of the Spatial Representation: Discrete vs. Continuous Computational Models, 2005

2004
Metrics for labelled Markov processes.
Theor. Comput. Sci., 2004

A relational model of non-deterministic dataflow.
Math. Struct. Comput. Sci., 2004

Metrics for Finite Markov Decision Processes.
Proceedings of the UAI '04, 2004

Mathematical techniques for analyzing concurrent and probabilistic systems.
CRM monograph series 23, American Mathematical Society, ISBN: 978-0-8218-3571-5, 2004

2003
Guest Editors' Foreword.
Nord. J. Comput., 2003

Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
J. Log. Algebraic Methods Program., 2003

Approximating labelled Markov processes.
Inf. Comput., 2003

Preface.
Proceedings of the Workshop on Domain Theoretic Methods for Probabilistic Processes, 2003

Labelled Markov Processes: Stronger and Faster Approximations.
Proceedings of the Workshop on Domain Theoretic Methods for Probabilistic Processes, 2003

Conditional Expectation and the Approximation of Labelled Markov Processes.
Proceedings of the CONCUR 2003, 2003

2002
Guest Editors' Foreword.
Nord. J. Comput., 2002

Bisimulation for Labelled Markov Processes.
Inf. Comput., 2002

Preface.
Proceedings of the 9th International Workshop on Expressiveness in Concurrency, 2002

The Metric Analogue of Weak Bisimulation for Probabilistic Processes.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

Weak Bisimulation is Sound and Complete for PCTL*.
Proceedings of the CONCUR 2002, 2002

2001
On the expressive power of first-order boolean functions in PCF.
Theor. Comput. Sci., 2001

Measure and probability for concurrency theorists.
Theor. Comput. Sci., 2001

Preface.
Proceedings of the 8th International Workshop on Expressiveness in Concurrency, 2001

Does Combining Nondeterminism and Probability Make Sense?
Bull. EATCS, 2001

Does Concurrency Theory Have Anything to Say About Parallel Programming?
Proceedings of the Current Trends in Theoretical Computer Science, 2001

2000
Generating irregular partitionable data structures.
Theor. Comput. Sci., 2000

From logic to stochastic processes (abstract only).
Proceedings of the 2nd international ACM SIGPLAN conference on on Principles and practice of declarative programming, 2000

Approximating Labeled Markov Processes.
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

1999
Stochastic Processes as Concurrent Constraint Programs.
Proceedings of the POPL '99, 1999

Metrics for Labeled Markov Systems.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998
The Category of Markov Kernels.
Proceedings of the First International Workshop on Probabilistic Methods in Verification, 1998

A Logical Characterization of Bisimulation for Labeled Markov Processes.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997
Bisimulation for Labelled Markov Processes.
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

1996
Does Concurrency Theory Have Anything To Say About Parallel Programming?
Bull. EATCS, 1996

1995
Reengineering User Interfaces.
IEEE Softw., 1995

A Logical View of Concurrent Constraint Programming.
Nord. J. Comput., 1995

The Expressive Power of Indeterminate Primitives in Asynchronous Computation.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

A design study of the EARTH multiprocessor.
Proceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques, 1995

1994
The Logical Structure of Concurrent Constraint Programming Languages (Abstract).
Proceedings of the CONCUR '94, 1994

1993
Book Review: Programs, Recursion and Unbounded Choice. By Wim H. Hesselink. (Cambridge University Press, 1992. xii+223 pages. ISBN 0-521-40436-3. $39 .95).
SIGACT News, 1993

Nonexpressibility of Fairness and Signaling.
J. Comput. Syst. Sci., 1993

Reverse Engineering of User Interfaces.
Proceedings of Working Conference on Reverse Engineering, 1993

Holomorhpic Models of Exponential Types in Linear Logic.
Proceedings of the Mathematical Foundations of Programming Semantics, 1993

Minimal Memory Schedules for Dataflow Networks.
Proceedings of the CONCUR '93, 1993

1992
The Expressive Power of Indeterminate Dataflow Primitives
Inf. Comput., May, 1992

A Logic for Reasoning About Security.
ACM Trans. Comput. Syst., 1992

Concurrent Common Knowledge: Defining Agreement for Asynchronous Systems.
Distributed Comput., 1992

A Hyperdoctrinal View of Concurrent Constraint Programming.
Proceedings of the Sematics: Foundations and Applications, 1992

Well-behaved dataflow programs for DSP computation.
Proceedings of the 1992 IEEE International Conference on Acoustics, 1992

1991
A Fully Abstract Semantics for a First-Order Functional Language with Logic Variables.
ACM Trans. Program. Lang. Syst., 1991

The Expressive Power of Delay Operators in SCCS.
Acta Informatica, 1991

Semantic Foundations of Concurrent Constraint Programming.
Proceedings of the Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, 1991

The Common Order-Theoretic Structure of Version Spaces and ATMS's.
Proceedings of the 9th National Conference on Artificial Intelligence, 1991

1990
Stability and Sequentiality in Dataflow Networks.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

A Domain-Theoretic Model for a Higher-Order Process Calculus.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

A Mechanically Assisted Constructive Proof in Category Theory.
Proceedings of the 10th International Conference on Automated Deduction, 1990

1989
Effect analysis in higher-order languages.
Int. J. Parallel Program., 1989

A Category-theoretic Semantics for Unbounded Indeterminacy.
Proceedings of the Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29, 1989

A Fully Abstract Semantics for a Functional Language with Logic Variables
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1988
Type theory and concurrency.
Int. J. Parallel Program., 1988

Concurrent Common Knowledge: A New Definition of Agreement for Asynchronous Systems.
Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

Computations, Residuals, and the POwer of Indeterminancy.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

McCarthy's Amb Cannot Implement Fair Merge.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1988

Security by Permission in Databases.
Proceedings of the Database Security, 1988

Reasoning about Knowledge and Permission in Secure Distributed Systems.
Proceedings of the First IEEE Computer Security Foundations Workshop, 1988

Expressiveness Bounds for Completness in Trace-Based Network Proof Systems.
Proceedings of the CAAP '88, 1988

1987
Computation of Aliases and Support Sets.
Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

1986
Semantics of Digital Networks Containing Indeterminate Modules.
Distributed Comput., 1986

Infinite Objects in Type Theory
Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

Verification of Systolic Arrays: A Stream Function Approach.
Proceedings of the International Conference on Parallel Processing, 1986

Implementing mathematics with the Nuprl proof development system.
Prentice Hall, ISBN: 978-0-13-451832-9, 1986

1984
Stream-Based Execution of Logic Programming.
Proceedings of the 1984 International Symposium on Logic Programming, 1984

Abstract Interpretation and Indeterminacy.
Proceedings of the Seminar on Concurrency, 1984

Semantics of Networks Containing Indeterminate Operators.
Proceedings of the Seminar on Concurrency, 1984


  Loading...