Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
Prakash Panangaden (Publications)

Prakash Panangaden

E-mail: prakash@cs.mcgill.ca
Office: McENG 108
Office Phone: (514) 398-7074
Office FAX: (514)398-3883

Working Papers

The Measurement Calculus [PDF] Under review.

Accepted Papers

A Domain of spacetime intervals for general relativity by Keye Martin and Prakash Panangaden. [PDF] Appeared online (Aug 15 2006) in Communications of Mathematical Physics.
Quantum Weakest Preconditions by Ellie D'Hondt and Prakash Panangaden. Full version in pdf format; appeared in Mathematical Structures in Computer Science.
by Ellie D'Hondt and Prakash Panangaden. Proof version in ps.
Bisimulation and Cocongruence for Probabilistic Systems by Vincent Danos, Josee Desharnais, Francois Laviolette and Prakash Panangaden. This has appeared in Information and Computation. ps version
Bisimulation and Cocongruence for Probabilistic Systems by Vincent Danos, Josee Desharnais, Francois Laviolette and Prakash Panangaden. This is has appeared on Information and Computation. pdf version
Approximate Reasoning for Real-time Probabilistic Processes by Vineet Gupta, Radha Jagadeesan and Prakash Panangaden. Full version of a paper presented at QEST 2004. Appeared in LMCS. pdf format

Recent Conference Papers

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]
Approximate reasoning for real-time probabilistic processes by Vineet Gupta, Radha Jagadeesan and Prakash Panangaden. To be presented at the First Symposium on Quantitative Evaluation of Systems QEST04; Twente, The Netherlands.
The Metric Analogue of Weak Bisimulation for Probabilistic Processes by Josee Desharnais, Vineet Gupta, Radha Jagadeesan and Prakash Panangaden (postscript version). Full version of the paper to appear in LICS'02
The Metric Analogue of Weak Bisimulation for Probabilistic Processes by Josee Desharnais, Vineet Gupta, Radha Jagadeesan and Prakash Panangaden (pdf version). Full version of the paper to appear in LICS'02
Weak Bisimulation is Sound and Complete for pCTL* by Josee Desharnais, Vineet Gupta, Radha Jagadeesan and Prakash Panangaden. To appear in CONCUR'02.
Stochastic Processes as Concurrent Constraint Programs by Vineet Gupta, Radha Jagadeesan and Prakash Panangaden. Presented at POPL 1999.
Metrics for Labeled Markov Systems by Josee Desharnais, Vineet Gupta, Radha Jagadeesan and Prakash Panangaden. CONCUR 1999.

Selected Journal Publications with web links

Labelled Markov Processes: Stronger and Faster Approximants by Vincent Danos, Josee Desharnais and Prakash Panangaden. This appeared in ENTCS vol 87 (2004) and combines the 2003 LICS paper by Vincent and Josee and the 2003 Concur paper by the 3 of us.
Metrics for Labelled Markov Processes by Josee Desharnais, Vineet Gupta, Radha Jagadeesan and Prakash Panangaden. Appeared in Theoretical Computer Science 2004. [PDF]
Metrics for Labelled Markov Processes by Josee Desharnais, Vineet Gupta, Radha Jagadeesan and Prakash Panangaden. Appeared in Theoretical Computer Science 2004. [PS]
A Relational Model of Nondeterministic Dataflow by Thomas Hildebrandt, Prakash Panangaden and Glynn Winskel. Accepted in Mathematical Structures in Computer Science.
Discrete Quantum Causal Dynamics by Richard Blute, Ivan T. Ivanov and Prakash Panangaden. This is available as gr-qc/0109053 from xxx.lanl.gov; this version has an expository appendix on density matrices. Aappeared in 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. Full version of LICS2000 paper. Appeared in Information and Computation 2003.
Continuous Stochastic Logic Characterizes Bisimulation for Continuous-time Markov Processes by Josee Desharnais and Prakash Panangaden. To appear in Journal of Logic and Algebraic Programming. ps version.
Continuous Stochastic Logic Characterizes Bisimulation for Continuous-time Markov Processes by Josee Desharnais and Prakash Panangaden. To appear in Journal of Logic and Algebraic Programming. pdf version
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 and 1998) papers on this topic. This has appeared in the Dec 2002 issue of Information and Computation.
The Expressiveness of Indeterminate Dataflow Primitives, by P. Panangaden and V. Shanbhogue, Information and Computation, Vol 98, No. 1, May 1992, pp 99-131.
Concurrent Common Knowledge,, by P. Panangaden and K. E. Taylor, Distributed Computing, 6:73-93, June 1992.
Nonexpressibility of Signaling and Fairness, by David MacAllester, P. Panangaden and Vasant Shanbhogue, Journal of Computer and System Sciences, Volume 47, No. 2, October 1993, pp.287-321.
A Logical View of Concurrent Constraint Programming, by Nax P. Mendler, Prakash Panangaden, P. J. Scott and R. A. G. Seely, Nordic Journal of Computing, Volume 2, 182-221, 1995.
The Expressive Power of Indeterminate Primitives in Asynchronous Computation, by Prakash Panangaden, Proceedings of FSTTCS, Dec 1995.
Nuclear and Trace Ideals in Tensored *-Categories,, by Samson Abramsky, Richard Blute and Prakash Panangaden. This has appeared in the Journal of Pure and Applied Algebra.

Other Selected Journal Publications

Semantics of Digital Networks Containing Indeterminate Modules, by R. M. Keller and P. Panangaden, Distributed Computing, Volume 1, Number 4, pp 235-245, 1986.
Type Theory and Concurrency by R. Cleaveland and P. Panangaden, International Journal of Parallel Programming, Vol. 17, No. 2, 1988, pp 153-206.
Effect Analysis in Higher-Order Languages by A. Neirynck, P. Panangaden and A. J. Demers, International Journal of Parallel Programming, Vol 18, No 1, 1989, pp 1-37.
A Category-theoretic Analysis of Recursively Defined Types, by P. Panangaden, N. P. Mendler and M. I. Schwartzbach, in Resolution of Equations in Algebraic Structures I, eds. H. Ait-Kaci and M. Nivat, Academic Press, 1989.
On the Expressive Power of Delay Operators in SCCS, by C. M. Critchlow and P. Panangaden, Acta Informatica, 28, 447-452, 1991.
A Fully Abstract Model of a Functional Language with Logic Variables, by R. Jagadeesan, K. Pingali and P. Panangaden, ACM Transactions On Programming Languages And Systems, Volume 13, 4, pp 577-625, Oct 1991.
Reverse Engineering and Reengineering of User Interfaces, by E. Merlo, Pierre-Yves Gagne', J. F. Girard, K. Kontogiannis, L.Hendren, P. Panangaden, R. De Mori, IEEE Software, January 1995.
A Logic for Reasoning About Security, by Janice Glasgow, Glenn MacEwen and Prakash Pananagden, ACM Transactions on Computer Systems, Vol. 10, No. 3, August 1992, pp. 226-264.

Selected Conference papers with web Links

Old Foundations for Linear Logic by R. Blute, P. Panangaden and R. Seely, Proceedings of the 9th Symposium on Mathematical Foundations of Programming Semantics, April 1993; Lecture Notes In Computer Science 802, pp. 474-512.
Sequentiality and Stability in Dataflow Networks, by P. Panangaden, V. Shanbhogue and E. W. Stark, Proceedings of the 17th International Colloquium on Automata Languages and Programming, Warwick, 1990, pp 181-194, Lecture Notes in Computer Science 443.
Computations, Residuals and the Power of Indeterminacy, by P. Panangaden and E. W. Stark, Proceedings of ICALP 1988, ed. T. Lepisto and A. Salomaa, Lecture Notes in Computer Science 317, pp 439-454.

Other Conference papers

Stream-Based Execution of Logic Programs, by G. Lindstrom and P. Panangaden, First International Logic Programming Conference, Atlantic City, pp. 168-176, 1984.
Semantics of Networks Containing Indeterminate Operators, by R. M. Keller and P. Panangaden in Seminar on Concurrency, S. D. Brookes, A. W. Roscoe and G. Winskel eds., Lecture Notes In Computer Science 197, pp. 479-496, 1985.
Abstract Interpretation and Indeterminacy, by P. Panangaden. in Seminar on Concurrency, S. D. Brookes, A. W. Roscoe and G. Winskel eds., Lecture Notes In Computer Science 197 pp. 479-496, 1985.
Infinite Objects in Type Theory by N. P. Mendler, P. Panangaden and R. Constable, in Proceedings of the IEEE Symposium on Logic in Computer Science, Cambridge, MA, June 16-19, pp. 249-255, 1986.
Verifying Systolic Arrays: a Stream-functional Approach, by S. Rajopadhye and P. Panangaden, Proceedings of the International Conference on Parallel Processing, pp 778-782, 1986.
Computation of Aliases and Support Sets, by A. Neirynck, P. Panangaden and A. J. Demers, Proceedings of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pp 274-283, 1987.
Expressiveness Bounds for Completeness in Trace-based Network Proof Systems, by J. Widom and P. Panangaden, Proceedings of CAAP 88, Lecture Notes in Computer Science 299,eds. M Dauchet and M. Nivat, pp 200-214, 1988.
Concurrent Common Knowledge, by P. Panangaden and K. E. Taylor, Proceedings of ACM Symposium on Principles of Distributed Computing, 1988, pp. 197-209.
Nonexpressibility of Signaling and Fairness, by D. MacAllester, P. Panangaden and V. Shanbhogue, Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science 1988, pp 377-386.
McCarthy's Amb Cannot Implement Fair Merge, by P. Panangaden and V. Shanbhogue, Proceedings of the 8th Conference on Foundations of Software Technology and Theoretical Computer Science, Pune, India, 1988, Lecture Notes in Computer Science 338, pp 348-363.
A Category-theoretic Semantics for Unbounded Indeterminacy by P. Panangaden and J. R. Russell, Proceedings of the 5th Conference on Mathematical Foundations of Programming Semantics, New Orleans, 1989, pp 319-332. Lecture Notes In Computer Science 442.
A Fully Abstract Semantics for a Functional Language with Logic Variables by R. Jagadeesan, P. Panangaden and K. Pingali, Proceedings of the 4th Annual IEEE Symposium on Logic in Computer Science, 1989, pp 294-303.
A Domain-theoretic Model of a Higher-order Process Calculus, by R. Jagadeesan and P. Panangaden, Proceedings of the 17th International Colloquium On Automata Languages and Programming, Warwick, 1990, Lecture Notes in Computer Science 443, pp. 181-194.
A Mechanically Assisted Proof in Category Theory, by J. A. Altucher and P. Panangaden, Proceedings of the 10th Conference on Automated Deduction, Karlsruhe, West Germany, July 1990, pp. 500-513.
Fair Merge as a Colimit, by D. B. Benson, P. Panangaden and J. R. Russell, Proceedings of the BCS-FACS workshop on Concurrency, Leicester, 1990, pp. 175-184.
The Semantic Foundations of Concurrent Constraint Programing by V. Saraswat, M. Rinard and P. Panangaden, Proceedings Of The Eighteenth Annual ACM Symposium On Principles Of Programming Languages, Jan 1991, pp. 333-352.
The Common Order-theoretic Structure of Version Spaces and ATMS by C. Gunter, T. H. Ngair, P. Panangaden and D. Subramaniam, Proceedings of the 1991 AAAI Conference.
Reverse Engineering of User Interfaces, by Merlo E., Girard J. F., Kontogiannis K., Panangaden P., De Mori R., Working Conference on Reverse Engineering, May 21-23, 1993, Baltimore, Maryland
Minimal Memory Schedules for Dataflow Networks by Marija Cubric and Prakash Panangaden, Proceedings of CONCUR 93, ed. Eike Best, August 1993, Lecture Notes In Computer Science 715, pp. 368-383.

Jan 2005