FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A note on the attractor-property of infinite-state Markov chain
Information Processing Letters
CSL model checking algorithms for QBDs
Theoretical Computer Science
Sliding Window Abstraction for Infinite Markov Chains
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
A note on the attractor-property of infinite-state Markov chains
Information Processing Letters
Stochastic games with lossy channels
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Computing the expected accumulated reward and gain for a subclass of infinite markov chains
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
On Almost-Sure Properties of Probabilistic Discrete Event Systems
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Hi-index | 0.00 |
The theme of this paper is profunctors, and their centrality and ubiquity in understanding concurrent computation. Profunctors (a.k.a. distributors, or bimodules) are a generalisation of relations to categories. Here they are first presented and motivated ...