Michael W. Mislove
Pendergraft Herbert Buchanan Professor
Department of Mathematics
Tulane University


Address: Department of Mathematics
         Tulane University 
         New Orleans, LA 70118

Email:   
    	 
Office:  Gibson 400C
Phone:  +1 504 862-3441
FAX:    +1 504 865-5063
Research Interests:


Editorial Information


Slides from Some Recent Talks


Research Papers

A reasonably complete listing of my research papers since 1985 can be found here.
References with citations can be found on Google Scholar

Below are abstracts of some recent papers by me and my co-authors, as well as links to copies of the papers.

Concurrency Theory

Domain Theory

Testing and Labelled Markov Processes

Security

For some time, Aaron Jaggard (DIMACS), Catherine Meadows (NRL), Roberto Segala (Verona) and I have been working on the task-based PIOA model of concurrency that has been used by Canetti, Lynch, Segala and others to model security and crypto-protocols, in particular. PIOAs are probabilistic input/output automata a model for concurrent computation first devised by Nancy Lynch (MIT) and Roberto Segala. The notion of a task was introduced in the work with Canetti as a means for restricting the power of the adversary, making the model more realistic for applications to security. The main result obtained by Canetti, et al has been a model for oblivious tranfer that includes reasoning about cryptographic primtiives, rather than the more traditional “Dolev-Yao” approach that assumes perfect cryptography. For a more precise description of this work and a list of publication see Ling Cheung's Task-PIOA and Security Verification web page.

Our focus has been on devising an approach to developing PIOAs that uses domain theory to establish the main results about discrete probability, which lies at the heart of the PIOA model. So far, we have a working draft that includes a number of basic results about PIOAs from our perspective, and a preprint that shows how to model the DIning Cryptographers using the task-based PIOA approach.