The complexity of elementary algebra and geometry
Journal of Computer and System Sciences
A Discipline of Programming
Dynamic Logic
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Power Domains and Predicate Transformers: A Topological View
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Metrics for Labeled Markov Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Weak Bisimulation is Sound and Complete for PCTL*
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Bisimulation for Labelled Markov Processes
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Logical Characterization of Bisimulation for Labeled Markov Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Approximating Labeled Markov Processes
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Approximating labelled Markov processes
Information and Computation
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Coinductive Proof Principles for Stochastic Processes
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Approximating Markov Processes by Averaging
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Labelled Markov Processes
| Hi-index | 0.00 |
In the Fall of 1985 Dexter and I both started at Cornell as new faculty members in the celebrated Computer Science Department, home to luminaries such as Juris Hartmanis, John Hopcroft, David Gries and Robert Constable. I was a very new assistant professor but Dexter was already an acknowledged star with celebrated contributions to several areas: algebra and complexity, decision procedures for real-closed fields [1], dynamic logic [2-4] and many other areas across both tracks of theoretical computer science. I had no doctorate in computer science, hardly any publications and no clearly defined research area. Early in the term Dexter summoned me to his office and grilled me about work I was doing on nondeterministic dataflow. After that meeting I needed several glasses of beer to recover but a lasting friendship was sealed.